Main-memory triangle computations for very large (sparse (power-law)) graphs

Theoretical Computer Science

Volumn 407, Issue 1-3, 2008, Pages 458-473

  Latapy, Matthieu ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Algorithms; Complex networks; Graphs; Triangles

Indexed keywords

ALGORITHMS; DRUG PRODUCTS PLANTS; ELECTRIC NETWORK ANALYSIS; NETWORK PROTOCOLS; SENSOR NETWORKS; TRIANGULATION;

COMPLEX NETWORK ANALYSIS; COMPLEX NETWORKS; EXPERIMENTAL STUDIES; FUNDAMENTAL PROBLEMS; GRAPHS; MAIN MEMORIES; POWER LAWS; SPACE COMPLEXITIES; TIME-OPTIMAL; TRIANGLES;

GRAPH THEORY;

EID: 53449095174     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.07.017     Document Type: Article

References (41)

1. Albert R., and Barabási A.-L. Statistical mechanics of complex networks. Rev. Modern Phys. 74 47 (2002)
2. Noga Alon, Raphael Yuster, Uri Zwick, Finding and counting given length cycles, in: European Symposium Algorithms, ESA, 1994
3. Alon N., Yuster R., and Zwick U. Finding and counting given length cycles. Algorithmica 17 3 (1997) 209-223
4. Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar, Reduction in streaming algorithms with an application of counting triangles in graphs, in: ACM/SIAM Symposium On Discrete Algorithms, SODA, 2002
5. Vladimir Batagelj, Personnal communication, 2006
6. Batagelj V., and Mrvar A. Pajek: A program for large network analysis. Connections 21 2 (1998) 47-57
7. Batagelj V., and Mrvar A. A subquadratic triad census algorithm for large sparse networks with small maximum degree. Social Networks 23 (2001) 237-243
8. P. Boldi, S. Vigna, The webgraph framework i: Compression techniques, in: WWW, 2004
9. P. Boldi, S. Vigna, The webgraph framework ii: Codes for the world-wide web, in: DCC, 2004
10. Boldi P. WebGraph project. http://webgraph.dsi.unimi.it/
11. Boldi P., Codenotti B., Santini M., and Vigna S. Ubicrawler: A scalable fully distributed web crawler. Softw., Pract. Exper. 34 8 (2004) 711-726
12. Bollobás B., and Riordan O.M. Mathematical results on scale-free random graphs. Handbook of Graphs and Networks: From the Genome to the Internet (2002), Wiley-VCH
13. In: Brandes U., and Erlebach T. (Eds). Network Analysis: Methodological Foundations. LNCS (2005), Springer-Verlag
14. Chiba N., and Nishizeki T. Arboricity and subgraph listing algorithms. SIAM J. Comput. 14 (1985)
15. Cohen R., Erez R., ben Avraham D., and Havlin S. Reply to the comment on 'breakdown of the internet under intentional attack'. Phys. Rev. Lett. 87 (2001)
16. Coppersmith D., and Winograd S. Matrix multiplication via arithmetic progressions. J. Symb. Comput. 9 3 (1990) 251-280
17. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms. second edition (2001), MIT Press
18. Dorogovtsev S.N., and Mendes J.F.F. Comment on 'breakdown of the internet under intentional attack'. Phys. Rev. Lett. 87 (2001)
19. Stephen Eubank, V.S. Anil Kumar, Madhav V. Marathe, Aravind Srinivasan, Nan Wang, Structural and algorithmic aspects of massive social networks, in: ACM/SIAM Symposium on Discrete Algorithms, SODA, 2004
20. Gianni Franceschini, S. Muthukrishnan, Mihai Pǎtraşcu, Radix sorting with no extra space, in: European Symposium on Algorithms, ESA, 2007, pp. 194-205
21. Harary F., and Kommel H.J. Matrix measures for transitivity and balance. J. Math. Sociology (1979)
22. Harary F., and Paper H.H. Toward a general calculus of phonemic distribution. Language: J. Linguistic Soc. America 33 (1957) 143-169
23. Monika Rauch Henzinger, Prabhakar Raghavan, Sridar Rajagopalan, Computing on data streams, Technical report, DEC Systems Research Center, 1998
24. Itai A., and Rodeh M. Finding a minimum circuit in a graph. SIAM J. Comput. 7 4 (1978) 413-423
25. H. Jowhari, M. Ghodsi, New streaming algorithms for counting triangles in graphs, in: COCOON, 2005
26. Latapy M. Triangle computation web page. http://www.liafa.jussieu.fr/~latapy/Triangles/
27. Matthieu Latapy, Clémence Magnien, Complex network measurements: Estimating the relevance of observed properties, in: Proceedings of Infocom'08, Phoenix, USA, 2008
28. J. Leskovec, J. Kleinberg, C. Faloutsos, Graphs over time: Densification laws, shrinking diameters and possible explanations, in: ACM SIGKDD, 2005
29. Milo R., Shen-Orr S., Itzkovitz S., Kashtan N., Chklovskii D., and Alon U. Network motifs: Simple building blocks of complex networks. Science 298 (2002) 824-827
30. Monien B. How to find long paths efficiently. Ann. Discrete Math. 25 (1985) 239-254
31. Edling C.R., Holme P., and Liljeros F. Structure and time-evolution of an internet dating community. Social Networks 26 2 (2004)
32. Schank T., and Wagner D. Approximating clustering coefficient and transitivity. J. Graph Algorithms Appl. (JGAA) 9 2 (2005) 265-275
33. Thomas Schank, Dorothea Wagner, Finding, counting and listing all triangles in large graphs, Technical report, Universität Karlsruhe, Fakultät für Informatik, 2005
34. Thomas Schank, Dorothea Wagner, Finding, counting and listing all triangles in large graphs, an experimental study, in: Workshop on Experimental and Efficient Algorithms, WEA, 2005
35. Asaf Shapira, Noga Alon, Homomorphisms in graph property testing - a survey, in: Electronic Colloquium on Computational Complexity, ECCC, 2005
36. Watts D.J., and Strogatz S.H. Collective dynamics of smallworld networks. Nature 393 (1998) 440-442
37. Yeger-Lotem E., Sattath S., Kashtan N., Itzkovitz S., Milo R., Pinter R.Y., Alon U., and Margalit H. Network motifs in integrated cellular networks of transcription-regulation and protein-protein interaction. Proc. Natl. Acad. Sci. USA 101 (2004) 5934-5939
38. Raphael Yuster, Uri Zwick, Detecting short directed cycles using rectangular matrix multiplication and dynamic programming, in: ACM/SIAM Symposium on Discrete Algorithms, SODA, 2004, pp. 254-260
39. Raphael Yuster, Uri Zwick, Fast sparse matrix multiplication, in: European Symposium on Algorithms, ESA, 2004, pp. 604-615
40. Metrosec project. http://www2.laas.fr/METROSEC/
41. Persi project. http://www.liafa.jussieu.fr/~persi/