Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis

IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium

Volumn , Issue , 2009, Pages

  Madduri, Kamesh ^a   Bader, David A ^b  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AS GRAPH; COMBINATORIAL TECHNIQUES; COMPACT GRAPH; COMPLEX NETWORK ANALYSIS; CONNECTIVITY ALGORITHMS; DYNAMIC GRAPH; DYNAMIC INTERACTION; DYNAMIC NETWORK ANALYSIS; GRAPH-THEORETIC; INFORMATION NETWORKS; INSERTIONS AND DELETIONS; MASSIVE DATA SETS; MULTI-CORE PROCESSOR; NEW APPROACHES; OPEN-SOURCE; PARALLEL IMPLEMENTATIONS; PARALLEL SPEEDUPS; SCIENTIFIC COMPUTING; SMALL WORLD NETWORKS; SOCIAL NETWORKING; TEMPORAL DATA; ULTRASPARC;

BEHAVIORAL RESEARCH; CONVOLUTIONAL CODES; DATA STRUCTURES; DISTRIBUTED PARAMETER NETWORKS; DYNAMIC ANALYSIS; ELECTRIC NETWORK ANALYSIS; INFORMATION SERVICES; PARALLEL ALGORITHMS;

GRAPH THEORY;

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

References (28)

1. L. Amaral, A. Scala, M. Barthélémy, and H. Stanley, "Classes of small-world networks," Proc. National Academy of Sciences USA, vol. 97, no. 21, pp. 11 149-11 152, 2000.
2. D. Bader and G. Cong, "Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs," in Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS 2004), Santa Fe, NM, Apr. 2004.
3. 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: IEEE Computer Society, Jun. 2005.
4. 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: IEEE Computer Society, Aug. 2006.
5. 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: IEEE Computer Society, Aug. 2006.
6. D. Bader and K. Madduri, "SNAP, Small-world Network Analysis and Partitioning: an open-source parallel graph framework for the exploration of large-scale networks," in Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS 2008), Miami, FL, Apr. 2008.
7. P. Boldi and S. Vigna, "The WebGraph framework I: compression techniques," in Proc. 13th Intl. Conf. on World Wide Web (WWW 13). New York, NY, USA: ACM Press, 2004, pp. 595-602.
8. D. Chakrabarti, Y. Zhan, and C. Faloutsos, "R-MAT: A recursive model for graph mining," in Proc. 4th SIAM Intl. Conf. on Data Mining (SDM). Orlando, FL: SIAM, Apr. 2004.
9. T. Coffman, S. Greenblatt, and S. Marcus, "Graph-based technologies for intelligence analysis," Communications of the ACM, vol. 47, no. 3, pp. 45-47, 2004.
10. C. Demetrescu, I. Finocchi, and G. Italiano, "Dynamic graphs," in Handbook on Data Structures and Applications, D. Mehta and S. Sahni, Eds. CRC Press, 2005, ch. 36.
11. C. Demetrescu, I. Finocchi, and A. Ribichini, "Trading off space for passes in graph streaming problems," in Proc. 17th Ann. Symp. Discrete Algorithms (SODA-06). Miami, FL: ACM Press, Jan. 2006, pp. 714-723.
12. D. Eppstein, Z. Galil, and G. Italiano, "Dynamic graph algorithms," in Handbook of Algorithms and Theory of Computation, M. Atallah, Ed. CRC Press, November 1998, ch. 8.
13. D. Eppstein, Z. Galil, G. Italiano, and A. Nissenzweig, "Sparsification: a technique for speeding up dynamic graph algorithms," J. ACM, vol. 44, no. 5, pp. 669-696, 1997.
14. M. Henzinger and V. King, "Randomized dynamic graph algorithms with polylogarithmic time per operation," in Proc. 27th Ann. Symp. of Theory of Computing (STOC). New York, NY, USA: ACM Press, 1995, pp. 519-527.
15. M. Henzinger, P. Raghavan, and S. Rajagopalan, "Computing on data streams," Compaq Systems Research Center, Palo Alto, CA, Tech. Rep. TR-1998-011, May 1998.
16. H. Jeong, S. Mason, A.-L. Barabási, and Z. Oltvai, "Lethality and centrality in protein networks," Nature, vol. 411, pp. 41- 42, 2001.
17. D. Kempe, J. Kleinberg, and A. Kumar, "Connectivity and inference problems for temporal networks," J. Comput. Syst. Sci., vol. 64, no. 4, pp. 820-842, 2002.
18. V. Krebs, "Mapping networks of terrorist cells," Connections, vol. 24, no. 3, pp. 43-52, 2002.
19. 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 (ALENEX07), New Orleans, LA, Jan. 2007.
20. S. Muthukrishnan, "Data streams: algorithms and applications," Foundations and Trends in Theoretical Computer Science, vol. 1, no. 2, pp. 117-236, 2005.
21. M. Newman, "The structure and function of complex networks," SIAM Review, vol. 45, no. 2, pp. 167-256, 2003.
22. J. Park, M. Penner, and V. Prasanna, "Optimizing graph algorithms for improved cache performance," in Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS 2002). Fort Lauderdale, FL: IEEE Computer Society, Apr. 2002.
23. R. Seidel and C. Aragon, "Randomized search trees," Algorithmica, vol. 16, pp. 464-497, 1996.
24. D. Sleator and R. Tarjan, "A data structure for dynamic trees," J. Comput. Syst. Sci., vol. 26, no. 3, pp. 362-391, 1983.
25. Y. Tian, R. McEachin, C. Santos, D. States, and J. Patel, "SAGA: A subgraph matching tool for biological graphs," Bioinformatics, vol. 23, no. 2, pp. 232-239, 2007.
26. D. Watts and S. Strogatz, "Collective dynamics of small world networks," Nature, vol. 393, pp. 440-442, 1998.
27. R. Werneck, "Design and analysis of data structures for dynamic trees," Ph.D. dissertation, Princeton University, Princeton, June 2006.
28. C. Zaroliagis, "Implementations and experimental studies of dynamic graph algorithms," in Experimental algorithmics: from algorithm design to robust and efficient software. New York, NY, USA: Springer-Verlag New York, Inc., 2002, pp. 229-278.