SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale networks
暂无分享,去创建一个
[1] A. Barabasi,et al. Lethality and centrality in protein networks , 2001, Nature.
[2] David A. Bader,et al. A Graph-Theoretic Analysis of the Human Protein-Interaction Network Using Multicore Parallel Algorithms , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.
[3] M E J Newman,et al. Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.
[4] Y. Mukaigawa,et al. Large Deviations Estimates for Some Non-local Equations I. Fast Decaying Kernels and Explicit Bounds , 2022 .
[5] A. Arenas,et al. Community detection in complex networks using extremal optimization. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.
[6] Cecilia R. Aragon,et al. Randomized search trees , 1989, 30th Annual Symposium on Foundations of Computer Science.
[7] S. Muthukrishnan,et al. Data streams: algorithms and applications , 2005, SODA '03.
[8] David A. Bader,et al. A fast, parallel spanning tree algorithm for symmetric multiprocessors , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..
[9] Ulrik Brandes,et al. On Finding Graph Clusterings with Maximum Modularity , 2007, WG.
[10] Sherry Marcus,et al. Graph-based technologies for intelligence analysis , 2004, CACM.
[11] David A. Bader,et al. An Experimental Study of A Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances , 2007, ALENEX.
[12] Franz Baader. Term Rewriting and Applications, 18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings , 2007, RTA.
[13] Ulrik Brandes,et al. Engineering graph clustering: Models and experimental evaluation , 2008, JEAL.
[14] Ulrik Brandes,et al. Network Analysis: Methodological Foundations , 2010 .
[15] David A. Bader,et al. Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks , 2006, 2006 International Conference on Parallel Processing (ICPP'06).
[16] Joseph JáJá,et al. An Introduction to Parallel Algorithms , 1992 .
[17] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.
[18] Bruce Hendrickson,et al. A Multi-Level Algorithm For Partitioning Graphs , 1995, Proceedings of the IEEE/ACM SC95 Conference.
[19] Kevin J. Lang. Fixing two weaknesses of the Spectral Method , 2005, NIPS.
[20] L. Amaral,et al. The web of human sexual contacts , 2001, Nature.
[21] George Karypis,et al. Multilevel algorithms for partitioning power-law graphs , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.
[22] M. Newman,et al. Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.
[23] David A. Bader,et al. A Graph-Theoretic Analysis of the Human Protein-Interaction Network Using Multicore Parallel Algorithms , 2007, IPDPS.
[24] Leonard M. Freeman,et al. A set of measures of centrality based upon betweenness , 1977 .
[25] Ulrik Brandes,et al. Network Analysis: Methodological Foundations (Lecture Notes in Computer Science) , 2005 .
[26] David A. Bader,et al. Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.
[27] George Karypis,et al. Multilevel k-way Partitioning Scheme for Irregular Graphs , 1998, J. Parallel Distributed Comput..
[28] David A. Bader,et al. Approximating Betweenness Centrality , 2007, WAW.
[29] Albert-László Barabási,et al. Statistical mechanics of complex networks , 2001, ArXiv.
[30] Christos H. Papadimitriou,et al. On the Eigenvalue Power Law , 2002, RANDOM.
[31] H E Stanley,et al. Classes of small-world networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.
[32] Kevin J. Lang. Finding good nearly balanced cuts in power law graphs , 2004 .
[33] Vladimir Batagelj,et al. Pajek - Program for Large Network Analysis , 1999 .
[34] David A. Bader,et al. On the architectural requirements for efficient execution of graph algorithms , 2005, 2005 International Conference on Parallel Processing (ICPP'05).
[35] David A. Bader,et al. Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2 , 2006, 2006 International Conference on Parallel Processing (ICPP'06).
[36] Ulrich Meyer,et al. Improved External Memory BFS Implementation , 2007, ALENEX.
[37] Mark E. J. Newman,et al. The Structure and Function of Complex Networks , 2003, SIAM Rev..
[38] M E J Newman,et al. Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.
[39] Anirban Dasgupta,et al. Spectral analysis of random graphs with skewed degree distributions , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[40] M E J Newman,et al. Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.
[41] Santosh S. Vempala,et al. On clusterings: Good, bad and spectral , 2004, JACM.
[42] S.,et al. An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .
[43] Santosh S. Vempala,et al. On clusterings-good, bad and spectral , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.