Colorful triangle counting and a MapReduce implementation

Information Processing Letters

Volumn 112, Issue 7, 2012, Pages 277-281

  Pagh, Rasmus ^a   Tsourakakis, Charalampos E ^b  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Concentration of measure; Graph algorithms; Parallel algorithms; Randomized algorithms

Indexed keywords

CONCENTRATION OF MEASURE; GRAPH ALGORITHMS; MAP-REDUCE; MONOCHROMATIC TRIANGLE; NUMBER OF TRIANGLES; RANDOMIZED ALGORITHMS; UNBIASED ESTIMATES;

COLOR; PARALLEL ALGORITHMS;

ALGORITHMS;

EID: 84855778834     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2011.12.007     Document Type: Article

References (25)

1. SNAP Stanford Library, http://snap.stanford.edu/.
2. N. Alon, and J.L. Spencer The Probabilistic Method 3rd edition 2008 Wiley-Interscience
3. N. Alon, R. Yuster, and U. Zwick Finding and counting given length cycles Algorithmica 17 3 1997 209 223 (Pubitemid 127440916)
4. H. Avron, Counting triangles in large graphs using randomized matrix trace estimation, in: Proceedings of KDD-LDMTA 10, 2010.
5. Z. Bar-Yosseff, R. Kumar, D. Sivakumar, Reductions in streaming algorithms, with an application to counting triangles in graphs, in: ACM-SIAM Symposium on Discrete Algorithms (SODA 02), 2002.
6. L. Becchetti, P. Boldi, C. Castillo, A. Gionis, Efficient semi-streaming algorithms for local triangle counting in massive graphs, in: 14th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD 08), 2008.
7. L. Buriol, G. Frahling, S. Leonardi, A. Marchetti-Spaccamela, C. Sohler, Counting triangles in data streams, in: Symposium on Principles of Database Systems (PODS 06), 2006.
8. H. Chernoff A note on an inequality involving the normal distribution Annals of Probability 9 3 1981 533 535
9. D. Coppersmith, S. Winograd, Matrix multiplication via arithmetic progressions, in: ACM Symposium on Theory of Computing (STOC 87), 1987.
10. J. Dean, S. Ghemawat, Simplified data processing on large clusters, in: Proceedings of OSDI, 2004, pp. 137-150.
11. A. Hajnal, and E. Szemerédi Proof of a conjecture of Erdös P. Erdös, A. Rényi, V.T. Sós, Combinatorial Theory and Its Applications, vol. 2 1970 601 623
12. S. Janson, and A. Ruciński The infamous upper tail Random Structures and Algorithms 20 2002 317 342 (Pubitemid 37340797)
13. M. Jerrum, L. Valiant, and V. Vazirani Random generation of combinatorial structures from a uniform distribution Theoretical Computer Science 43 2-3 1986 169 188
14. H. Jowhari, M. Ghodsi, New streaming algorithms for counting triangles in graphs, in: Computing and Combinatorics (COCOON 05), 2005.
15. J.H. Kim, and V.H. Vu Concentration of multivariate polynomials and its applications Combinatorica 20 3 2000 417 434
16. J.H. Kim, and V.H. Vu Divide and conquer martingales and the number of triangles in a random graph Journal of Random Structures and Algorithms 24 2 2004 166 174 (Pubitemid 38705922)
17. M.N. Kolountzakis, G.L. Miller, R. Peng, C.E. Tsourakakis, Efficient triangle counting in large graphs via degree-based vertex partitioning, Internet Mathematics, in press.
18. M. Latapy Main-memory triangle computations for very large (sparse (power-law)) graphs Theoretical Computer Science 407 1-3 2008 458 473
19. C. Papadimitriou, and M. Yannakakis The clique problem for planar graphs Information Processing Letters 13 1981 131 133
20. T. Schank, and D. Wagner Approximating clustering coefficient and transitivity Journal of Graph Algorithms and Applications 9 2005 265 275 (Pubitemid 41658049)
21. S. Suri, V. Vassilvitskii, Counting triangles and the curse of the last reducer, in: 20th World Wide Web Conference (WWW 11), 2011, in press, doi:10.1145/1963405.1963491.
22. C.E. Tsourakakis, Fast counting of triangles in large real networks, without counting: Algorithms and laws, in: International Conference on Data Mining (ICDM 08), 2008.
23. C.E. Tsourakakis, M.N. Kolountzakis, G.L. Miller, Triangle sparsifiers, Journal of Graph Algorithms and Applications, in press, http://www.cs.brown.edu/ sites/jgaa/accepted/2011/TsourakakisKolountzakisMiller2011.15.6.pdf.
24. C.E. Tsourakakis, U. Kang, G.L. Miller, C. Faloutsos, Doulion: Counting triangles in massive graphs with a coin, in: 15th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD 09), 2009.
25. V.H. Vu On the concentration of multivariate polynomials with small expectation Random Structures and Algorithms 16 4 2000 344 363