X
Forgot Password

If you have forgotten your password you can enter your email here and get a temporary password sent to your email.

Small-world Network Analysis and Partitioning

SNAP (Small-world Network Analysis and Partitioning) is an extensible parallel framework for exploratory analysis and partitioning of large-scale networks. SNAP is implemented in C, uses OpenMP primitives for parallelization, and targets sequential, multicore, and symmetric multiprocessor platforms. Our intent with SNAP is to provide a simple and intuitive interface for network analysis and application design, hiding the parallel programming complexity from the user. In addition to path-based, centrality, and community identification queries on large-scale graphs, we support commonly-used preprocessing kernels and quantitative measures that help understand the global network topology. The latest version of SNAP (0.4) was released in August 2010. Sponsors: This work was supported in part by NSF Grants CAREER CCF-0611589, NSF DBI-0420513, ITR EF/BIO 03-31654, IBM Faculty Fellowship and Microsoft Research grants, NASA grant NP-2005-07-375-HQ, and DARPA Contract NBCH30390004. Keywords: network, analysis, software, graph, traversal, betweenness centrality, community, identification, multicore,

URL: http://snap-graph.sourceforge.net

Resource ID: nif-0000-00425     Resource Type: Resource     Version: Latest Version

Synonyms

SNAP

Additional Resource Types

data processing software

Supercategory

Resource

Resource Status

Last checked up;

Parent Organization

Original Submitter

Anonymous

Version Status

Curated

Submitted On

12:00am September 21, 2010

Originated From

SciCrunch

Changes from Previous Version

First Version

Version 1

Created 4 years ago by Anonymous