SNAP, small-world network analysis and partitioning: An open-source parallel graph framework for the exploration of large-scale networks

IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM

Volumn , Issue , 2008, Pages

  Bader, David A ^a   Madduri, Kamesh ^a  

^a Georgia Institute of Technology

Author keywords

[No Author keywords available]

Indexed keywords

OPEN SOURCES; SMALL-WORLD NETWORKS;

CLUSTERING ALGORITHMS; COMPUTER NETWORKS; DATA STORAGE EQUIPMENT; DISTRIBUTED PARAMETER NETWORKS; ELECTRIC NETWORK ANALYSIS; EVOLUTIONARY ALGORITHMS; FLOW OF SOLIDS; HEURISTIC PROGRAMMING; OPTIMIZATION; PARALLEL ALGORITHMS;

GRAPH THEORY;

EID: 51049088410     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2008.4536261     Document Type: Conference Paper

References (40)

1. A. Abou-Rjeili and G. Karypis. Multilevel algorithms for partitioning power-law graphs. In Proc. Int'l Parallel and Distributed Proc. Symp. (IPDPS 2006), Rhodes, Greece, Apr. 2006.
2. D. Ajwani, U. Meyer, and V. Osipov. Improved external memory BFS implementations. In Proc. The 9th Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, LA, Jan. 2007.
3. R. Albert and A.-L. Barabási. Statistical mechanics of complex networks. Reviews of Modern Physics, 74(1):47-97, 2002.
4. L. Amaral, A. Scala, M. Barthélémy, and H. Stanley. Classes of small-world networks. Proc. National Academy of Sciences, 97(21):11149-11152, 2000.
5. D. Bader and G. Cong. A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs). Journal of Parallel and Distributed Computing, 65(9):994-1006, 2005.
6. D. Bader, G. Cong, and J. Feo. On the architectural requirements for efficient execution of graph algorithms. In Proc. 34th Int'l Conf. on Parallel Processing (ICPP), Oslo, Norway, June 2005. IEEE Computer Society.
7. D. Bader, S. Kintali, K. Madduri, and M. Mihail. Approximating betweenness centrality. In Proc. 5th Workshop on Algorithms and Models for the Web-Graph (WAW2007), Lecture Notes in Computer Science, San Diego, CA, December 2007. Springer-Verlag.
8. D. Bader and K. Madduri. Designing multithreaded algorithms for breadth-first search and st-connectivity on the Cray MTA-2. In Proc. 35th Int'l Conf. on Parallel Processing (ICPP), Columbus, OH, Aug. 2006. IEEE Computer Society.
9. D. Bader and K.Madduri. Parallel algorithms for evaluating centrality indices in real-world networks. In Proc. 35th Int'l Conf. on Parallel Processing (ICPP), Columbus, OH, Aug. 2006. IEEE Computer Society.
10. D. Bader and K. Madduri. A graph-theoretic analysis of the human protein interaction network using multicore parallel algorithms. In Proc. 6th Workshop on High Performance Computational Biology (HiCOMB 2007), Long Beach, CA, March 2007.
11. V. Batagelj and A.Mrvar. Pajek - program for large network analysis. Connections, 21(2):47-57, 1998.
12. U. Brandes, D. Delling, M. Gaertler, R. Görke, M. Höfer, Z. Nikoloski, and D. Wagner. On finding graph clusterings with maximum modularity. In Proc. 33rd Intl. Workshop on Graph-Theoretic Concepts in CS (WG 2007), Dornburg, Germany, June 2007.
13. U. Brandes and T. Erlebach, editors. Network Analysis: Methodological Foundations, volume 3418 of Lecture Notes in Computer Science. Springer-Verlag, 2005.
14. U. Brandes, M. Gaertler, and D.Wagner. Engineering graph clustering: Models and experimental evaluation. J. Exp. Algorithmics, 12:1.1, 2007.
15. A. Clauset, M. Newman, and C. Moore. Finding community structure in very large networks. Physical Review E, 70:066111, 2004.
16. T. Coffman, S. Greenblatt, and S. Marcus. Graph-based technologies for intelligence analysis. Communications of the ACM, 47(3):45-47, 2004.
17. J. Crobak, J. Berry, K. Madduri, and D. Bader. Advanced shortest path algorithms on a massively-multithreaded architecture. In Proc. Workshop on Multithreaded Architectures and Applications, Long Beach, CA, March 2007.
18. A. Dasgupta, J. Hopcroft, and F. McSherry. Spectral analysis of random graphs with skewed degree distributions. In Proc. 45th Ann. IEEE Symp. on Found. of Comp. Sci. (FOCS'04), pages 602-610, Washington, DC, USA, 2004. IEEE Computer Society.
19. J. Duch and A. Arenas. Community detection in complex networks using extremal optimization. Physical Review E, 72:027104, 2005.
20. L. Freeman. A set of measures of centrality based on betweenness. Sociometry, 40(1):35-41, 1977.
21. M. Girvan and M. Newman. Community structure in social and biological networks. Proc. National Academy of Sciences, 99(12):7821-7826, 2002.
22. B. Hendrickson and R. Leland. A multilevel algorithm for partitioning graphs. In Proc. Supercomputing '95, San Diego, CA, Dec. 1995.
23. J. JáJá. An Introduction to Parallel Algorithms. Addison-Wesley Publishing Company, New York, 1992.
24. H. Jeong, S. Mason, A.-L. Barabási, and Z. Oltvai. Lethality and centrality in protein networks. Nature, 411:41-42, 2001.
25. R. Kannan, S. Vempala, and A. Vetta. On clusterings: Good, bad and spectral. J. ACM, 51(3):497-515, 2004.
26. G. Karypis and V. Kumar. MeTiS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices. Dept. of Comp. Sci., Univ. of Minnesota, version 4.0 edition, Sept. 1998.
27. G. Karypis and V. Kumar. Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing, 48(1):96-129, 1998.
28. B. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49(2):291-307, 1970.
29. K. Lang. Finding good nearly balanced cuts in power law graphs. Technical report, Yahoo! Research, 2004.
30. K. Lang. Fixing two weaknesses of the spectral method. In Proc. Advances in Neurals Information Proc. Systems 18 (NIPS), Vancouver, Canada, December 2005.
31. F. Liljeros, C. Edling, L. Amaral, H. Stanley, and Y. Åberg. The web of human sexual contacts. Nature, 411:907-908, 2001.
32. K. Madduri, D. Bader, J. Berry, and J. Crobak. An experimental study of a parallel shortest path algorithm for solving large-scale graph instances. In Proc. The 9th Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, LA, Jan. 2007.
33. M. Mihail and C. Papadimitriou. On the eigenvalue power law. In J. Rolim and S. Vadhan, editors, Proc. 6th Intl. Workshop on Randomization and Approximation Techniques (RANDOM). Springer-Verlag, September 2002.
34. S. Muthukrishnan. Data streams: algorithms and applications. Foundations and Trends in Theoretical Computer Science, 1(2):117-236, August 2005.
35. M. Newman. The structure and function of complex networks. SIAM Review, 45(2):167-256, 2003.
36. M. Newman. Modularity and community structure in networks. Proc. National Academy of Sciences, 103(23):8577-8582, 2006.
37. M. Newman andM. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69:026113, 2004.
38. J. Pinney, G. McConkey, and D. Westhead. Decomposition of biological networks using betweenness centrality. In Proc. 9th Ann. Int'l Conf. on Research in Comp. Mol. Bio. (RECOMB 2005), Cambridge, MA, May 2005. Poster session.
39. R. Seidel and C. Aragon. Randomized search trees. Algorithmica, 16:464-497, 1996.
40. D. Watts and S. Strogatz. Collective dynamics of small world networks. Nature, 393:440-442, 1998.