Stanford Network Analysis Platform (SNAP) is a general purpose, high performance system for analysis and manipulation of large networks. Graphs consists of nodes and directed/undirected/multiple edges between the graph nodes. Networks are graphs with data on nodes and/or edges of the network. The core SNAP library is written in C++ and optimized for maximum performance and compact graph representation. It easily scales to massive networks with hundreds of millions of nodes, and billions of edges. It efficiently manipulates large graphs, calculates structural properties, generates regular and random graphs, and supports attributes on nodes and edges. Besides scalability to large graphs, an additional strength of SNAP is that nodes, edges and attributes in a graph or a network can be changed dynamically during the computation. SNAP was originally developed by Jure Leskovec in the course of his PhD studies. The first release was made available in Nov, 2009. SNAP uses a general purpose STL (Standard Template Library)-like library GLib developed at Jozef Stefan Institute. SNAP and GLib are being actively developed and used in numerous academic and industrial projects.

References in zbMATH (referenced in 23 articles )

Showing results 1 to 20 of 23.
Sorted by year (citations)

1 2 next

  1. Fasi, Massimiliano; Iannazzo, Bruno: Computing the weighted geometric mean of two large-scale matrices and its inverse times a vector (2018)
  2. Fosdick, Bailey K.; Larremore, Daniel B.; Nishimura, Joel; Ugander, Johan: Configuring random graph models with fixed degree sequences (2018)
  3. Azadbakht, Keyvan; Bezirgiannis, Nikolaos; de Boer, Frank S.: Distributed network generation based on preferential attachment in ABS (2017)
  4. Fox, Alyson; Manteuffel, Thomas; Sanders, Geoffrey: Numerical methods for Gremban’s expansion of signed graphs (2017)
  5. Giulio Rossetti, Letizia Milli, Salvatore Rinzivillo, Alina Sirbu, Fosca Giannotti, Dino Pedreschi: NDlib: a Python Library to Model and Analyze Diffusion Processes Over Complex Networks (2017) arXiv
  6. Hallac, David; Wong, Christopher; Diamond, Steven; Sharang, Abhijit; Sosič, Rok; Boyd, Stephen; Leskovec, Jure: SnapVX: a network-based convex optimization solver (2017)
  7. Ostroumova Prokhorenkova, Liudmila: General results on preferential attachment and clustering coefficient (2017)
  8. Glantz, Roland; Meyerhenke, Henning; Schulz, Christian: Tree-based coarsening and partitioning of complex networks (2016)
  9. Meyerhenke, Henning; Sanders, Peter; Schulz, Christian: Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering (2016)
  10. Prokhorenkova, L.A.; Krot, A.V.: Local clustering coefficients in preferential attachment models (2016)
  11. Zhou, Yunkai; Wang, Zheng; Zhou, Aihui: Accelerating large partial EVD/SVD calculations by filtered block Davidson methods (2016)
  12. Borassi, Michele; Crescenzi, Pierluigi; Habib, Michel; Kosters, Walter A.; Marino, Andrea; Takes, Frank W.: Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs (2015)
  13. Cordasco, Gennaro; Gargano, Luisa; Mecchia, Marco; Rescigno, Adele A.; Vaccaro, Ugo: A fast and effective heuristic for discovering small target sets in social networks (2015)
  14. David Hallac, Christopher Wong, Steven Diamond, Abhijit Sharang, Rok Sosic, Stephen Boyd, Jure Leskovec: SnapVX: A Network-Based Convex Optimization Solver (2015) arXiv
  15. Ye, Bin; Qiu, Liang; Wang, Xuesong; Guhr, Thomas: Spectral statistics in directed complex networks and universality of the Ginibre ensemble (2015)
  16. Safro, Ilya; Sanders, Peter; Schulz, Christian: Advanced coarsening schemes for graph partitioning (2014)
  17. Crescenzi, Pilu; Grossi, Roberto; Habib, Michel; Lanzi, Leonardo; Marino, Andrea: On computing the diameter of real-world undirected graphs (2013)
  18. Nettleton, David F.: Data mining of social networks represented as graphs (2013)
  19. Chen, Jie; Safro, Ilya: Algebraic distance on graphs (2011)
  20. Safro, Ilya; Temkin, Boris: Multiscale approach for the network compression-friendly ordering (2011)

1 2 next

Further publications can be found at: