Resource:Small-world Network Analysis and Partitioning

From NeuroLex

Resource:Small-world Network Analysis and Partitioning

Basic
Advanced

Name:	Resource:Small-world Network Analysis and Partitioning
Description:	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,
Other Name(s):	SNAP
Parent Organization:	Georgia Institute of Technology; Georgia; USA
Resource Type(s):	data processing software
Resource:	Resource
URL:	http://snap-graph.sourceforge.net
Id:	nif-0000-00425
Link to OWL / RDF:	Download this content as OWL/RDF

Curation status: Uncurated

This resource will be curated within 7 days.

For Resource Owners:
After the resource is curated, you may create a sitemap, which will help keep your registry description up-to-date and inform search engines about your resource.

Note: For a new resource, the website's URL must first be verified by a NIF curator before you may proceed.

Learn more about what NIF can do for your resource.
Proudly proclaim your inclusion in NIF by displaying the "Registered with NIF" button on your site. Please login to create the sitemap. (top right)

This page uses this default form:Resource

Contributors

Ccdbuser, Nifbot2

Facts about Resource:Small-world Network Analysis and PartitioningRDF feed

DefiningCitation	http://snap-graph.sourceforge.net  +
Definition	SNAP (Small-world Network Analysis … 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, ommunity, identification, multicore,
Has default formThis property is a special property in this wiki.	Resource +
Has role	Data processing software +
Id	nif-0000-00425 +
Is part of	Georgia Institute of Technology; Georgia; USA +
Label	Resource:Small-world Network Analysis and Partitioning +
ModifiedDate	18 May 2011 +
Page has default formThis property is a special property in this wiki.	Resource +
SuperCategory	Resource +
Synonym	SNAP +