mlsanityData to 7 Oct 2026

SNAP: A General Purpose Network Analysis and Graph Mining Library

arXiv 1606.07550 ↗First posted 24 Jun 2016cs.SI cs.DB physics.soc-phcited by 56

Not on the map. Why?

Abstract (arXiv)

Large networks are becoming a widely used abstraction for studying complex systems in a broad set of disciplines, ranging from social network analysis to molecular biology and neuroscience. Despite an increasing need to analyze and manipulate large networks, only a limited number of tools are available for this task. Here, we describe Stanford Network Analysis Platform (SNAP), a general-purpose, high-performance system that provides easy to use, high-level operations for analysis and manipulation of large networks. We present SNAP functionality, describe its implementational details, and give performance benchmarks. SNAP has been developed for single big-memory machines and it balances the trade-off between maximum performance, compact in-memory graph representation, and the ability to handle dynamic graphs where nodes and edges are being added or removed over time. SNAP can process massive networks with hundreds of millions of nodes and billions of edges. SNAP offers over 140 different graph algorithms that can efficiently manipulate large graphs, calculate structural properties, generate regular and random graphs, and handle attributes and meta-data on nodes and edges. Besides being able to handle large graphs, an additional strength of SNAP is that networks and their attributes are fully dynamic, they can be modified during the computation at low cost. SNAP is provided as an open source library in C++ as well as a module in Python. We also describe the Stanford Large Network Dataset, a set of social and information real-world networks and datasets, which we make publicly available. The collection is a complementary resource to our SNAP software and is widely used for development and benchmarking of graph analytics algorithms.

Key facts. Cited by 56 papers in the map (data through 7 Oct 2026). First posted on arXiv 24 Jun 2016.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 7; 2022: 11; 2023: 6; 2024: 9; 2025: 16; 2026: 7.

56 papers.

Sort:

By area:

  1. 2021OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphscited by 328
  2. 2021GREED: A Neural Framework for Learning Graph Distance Functionscited by 31
  3. 2023FairGen: Towards Fair Graph Generationcited by 12
  4. 2022Learning Individual Treatment Effects under Heterogeneous Interference in Networkscited by 11
  5. 2021GRAPE for Fast and Scalable Graph Processing and random walk-based Embeddingcited by 7
  6. 2021GNNSampler: Bridging the Gap between Sampling Algorithms of GNN and Hardwarecited by 6
  7. 2024When Heterophily Meets Heterogeneity: Challenges and a New Large-Scale Graph Benchmarkcited by 6
  8. 2025SEAM: Semantically Equivalent Across Modalities Benchmark for Vision-Language Modelscited by 6
  9. 2022Direct Embedding of Temporal Network Edges via Time-Decayed Line Graphscited by 5
  10. 2024A Survey of Few-Shot Learning on Graphs: from Meta-Learning to Pre-Training and Prompt Learningcited by 5
  11. 2025The KL3M Data Project: Copyright-Clean Training Resources for Large Language Modelscited by 5
  12. 2024Mamba Hawkes Processcited by 4
38 more
  1. 2022Towards Accurate Subgraph Similarity Computation via Neural Graph Pruningcited by 3
  2. 2023A Fast Algorithm for Moderating Critical Nodes via Edge Removalcited by 3
  3. 2024RoTHP: Rotary Position Embedding-based Transformer Hawkes Processcited by 3
  4. 2024Practicable Black-box Evasion Attacks on Link Prediction in Dynamic Graphs -- A Graph Sequential Embedding Methodcited by 3
  5. 2025HeroFilter: Adaptive Spectral Graph Filter for Varying Heterophilic Relationscited by 3
  6. 2022On the dynamics of credit history and social interaction features, and their impact on creditworthiness assessment performancecited by 2
  7. 2022All the World's a (Hyper)Graph: A Data Dramacited by 2
  8. 2025Differential Privacy Analysis of Decentralized Gossip Averaging under Varying Threat Modelscited by 2
  9. 2026Modality-free Graph In-context Alignmentcited by 2
  10. 2021Inferential SIR-GN: Scalable Graph Representation Learningcited by 1
  11. 2022Hardware/Software Co-Programmable Framework for Computational SSDs to Accelerate Deep Learning Service on Large-Scale Graphscited by 1
  12. 2022Interactive Visualization of Protein RINs using NetworKit in the Cloudcited by 1
  13. 2022High-order Order Proximity-Incorporated, Symmetry and Graph-Regularized Nonnegative Matrix Factorization for Community Detectioncited by 1
  14. 2022Strain-Minimizing Hyperbolic Network Embeddings with Landmarkscited by 1
  15. 2022Rethinking Efficiency and Redundancy in Training Large-scale Graphscited by 1
  16. 2023Knowledge Graphs are not Created Equal: Exploring the Properties and Structure of Real KGscited by 1
  17. 2023Viral Marketing in Social Networks with Competing Productscited by 1
  18. 2025SoK: Data Minimization in Machine Learningcited by 1
  19. 2025Still Competitive: Revisiting Recurrent Models for Irregular Time Series Predictioncited by 1
  20. 2025Efficient Algorithms for Computing Random Walk Centralitycited by 1
  21. 2025Promoting Fairness in Information Access within Social Networkscited by 1
  22. 2026Efficient Edge Rewiring Strategies for Enhancing PageRank Fairnesscited by 1
  23. 2021GraphBreak: Tool for Network Community based Regulatory Medicine, Gene co-expression, Linkage Disequilibrium analysis, functional annotation and morecited by 0
  24. 2021Influence Estimation and Maximization via Neural Mean-Field Dynamicscited by 0
  25. 2022G2A2: An Automated Graph Generator with Attributes and Anomaliescited by 0
  26. 2023A Constraints Fusion-induced Symmetric Nonnegative Matrix Factorization Approach for Community Detectioncited by 0
  27. 2023DANI: Fast Diffusion Aware Network Inference with Preserving Topological Structure Propertycited by 0
  28. 2024A short review on the maximum clique problem algorithms with classical, AI, and quantum methodscited by 0
  29. 2024Edge Probability Graph Models Beyond Edge Independency: Concepts, Analyses, and Algorithmscited by 0
  30. 2024IntOPE: Off-Policy Evaluation in the Presence of Interferencecited by 0
  31. 2024Theoretically Grounded Pruning of Large Ground Sets for Constrained, Discrete Optimizationcited by 0
  32. 2025Rethinking Link Prediction for Directed Graphscited by 0
  33. 2025Selective Use of Yannakakis' Algorithm to Improve Query Performance: Machine Learning to the Rescuecited by 0
  34. 2025SCOPE-DTI: Semi-Inductive Dataset Construction and Framework Optimization for Practical Usability Enhancement in Deep Learning-Based Drug Target Interaction Predictioncited by 0
  35. 2025MOCHA: Discovering Multi-Order Dynamic Causality in Temporal Point Processescited by 0
  36. 2025Adaptive Approach to Enhance Machine Learning Scheduling Algorithms During Runtime Using Reinforcement Learning in Metascheduling Applicationscited by 0
  37. 2025Speculative Sampling for Parametric Temporal Point Processescited by 0
  38. 2025Real-Time Personalized Content Adaptation through Matrix Factorization and Context-Aware Federated Learningcited by 0

50 most cited of 56 All 56 (JSON)