Parallel triangle counting in massive streaming graphs

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2013, Pages 781-786

  Tangwongsan, Kanat ^a   Pavan, A ^b   Tirthapura, Srikanta ^b  

^a IBM RESEARCH   (United States)

^b IOWA STATE UNIVERSITY   (United States)

Author keywords

Massive graphs; Parallel algorithm; Parallel cache oblivious (PCO); Streaming algorithm; Triangle counting

Indexed keywords

CACHE-OBLIVIOUS; DESIGN AND IMPLEMENTATIONS; FAST PARALLEL ALGORITHMS; MASSIVE GRAPH; SEQUENTIAL IMPLEMENTATION; STREAMING ALGORITHM; THEORETICAL GUARANTEES; TRIANGLE COUNTING;

KNOWLEDGE MANAGEMENT; PARALLEL ARCHITECTURES; SOCIAL NETWORKING (ONLINE);

PARALLEL ALGORITHMS;

EID: 84889586446     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2505515.2505741     Document Type: Conference Paper

References (30)

1. Z. Bar-Yossef, R. Kumar, and D. Sivakumar. Reductions in streaming algorithms, with an application to counting triangles in graphs. In Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 623-632, 2002.
2. L. Becchetti, P. Boldi, C. Castillo, and A. Gionis. Efficient semi-streaming algorithms for local triangle counting in massive graphs. In Proc. ACM Conference on Knowledge Discovery and Data Mining (KDD), pages 16-24, 2008.
3. J. W. Berry, L. Fosvedt, D. Nordman, C. A. Phillips, and A. G. Wilson. Listing triangles in expected linear time on power law graphs with exponent at least 7/3. Technical report, Sandia National Laboratories, 2011.
4. G E. Blelloch, P. B. Gibbons, and H. V. Simhadri. Low depth cache-oblivious algorithms. In SPAA'10, pages 189-199. ACM, 2010.
5. G E. Blelloch, J. T. Fineman, P. B. Gibbons, and H. V. Simhadri. Scheduling irregular parallel computations on hierarchical caches. In SPAA'11, pages 355-366. ACM, 2011.
6. L. S. Buriol, G. Frahling, S. Leonardi, and C. Sohler. Estimating clustering indexes in data streams. In Proc. European Symposium on Algorithms (ESA), pages 618-632, 2007.
7. N. Chiba and T. Nishizeki. Arboricity and subgraph listing algorithms. SIAM Journal on computing, 14:210-223, 1985.
8. S. Chu and J. Cheng. Triangle listing in massive networks and its applications. In Knowledge Data and Discovery (KDD), pages 672-680, 2011.
9. J. Cohen. Graph twiddling in a mapreduce world. Computing in Science and Engineering, 11:29-41, 2009.
10. J.-P. Eckmann and E. Moses. Curvature of co-links uncovers hidden thematic layers in the world wide web. Proceedings of the National Academy of Sciences, 99(9):5825-5829, 2002. doi:10.1073/pnas.032093399.
11. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In FOCS, 1999.
12. Intel Corp. Intel Cilk Plus, 2013. http://cilkplus.org/.
13. M. Jha, C. Seshadhri, and A. Pinar. From the birthday paradox to a practical sublinear space streaming algorithm for triangle counting. CoRR, abs/1212.2264, 2012.
14. H. Jowhari and M. Ghodsi. New streaming algorithms for counting triangles in graphs. In Proc. 11th Annual International Conference Computing and Combinatorics (COCOON), pages 710-716, 2005.
15. D. M. Kane, K. Mehlhorn, T. Sauerwald, and H. Sun. Counting arbitrary subgraphs in data streams. In Proc. International Colloquium on Automata, Languages, and Programming (ICALP), pages 598-609, 2012.
16. M. N. Kolountzakis, G. L. Miller, R. Peng, and C. E. Tsourakakis. Efficient triangle counting in large graphs via degree-based vertex partitioning. In WAW, pages 15-24, 2010.
17. K. Kutzkov and R. Pagh. On the streaming complexity of computing local clustering coefficients. In Proceedings of 6th ACM conference on Web Search and Data Mining (WSDM), 2013.
18. M. Latapy. Main-memory triangle computations for very large (sparse (power-law)) graphs. Theoretical Computer Science, 407:458-473, 2008.
19. J. Leskovec. Stanford large network dataset collection. http://snap.stanford.edu/data/index.html, 2012. Accessed Dec 5, 2012.
20. M. Manjunath, K. Mehlhorn, K. Panagiotou, and H. Sun. Approximate counting of cycles in streams. In Proc. European Symposium on Algorithms (ESA), pages 677-688, 2011.
21. M. E. J. Newman. The structure and function of complex networks. SIAM REVIEW, 45:167-256, 2003.
22. R. Pagh and C. E. Tsourakakis. Colorful triangle counting and a mapreduce implementation. Inf. Process. Lett., 112(7): 277-281, 2012.
23. A. Pavan, K. Tangwongsan, S. Tirthapura, and K.-L. Wu. Counting and sampling triangles from a graph stream. PVLDB, 6(14), 2013.
24. T. Schank and D. Wagner. Finding, counting and listing all triangles in large graphs, an experimental study. In Workshop on Experimental and Efficient Algorithms (WEA), pages 606-609, 2005.
25. J. Shun, G. E. Blelloch, J. T. Fineman, P. B. Gibbons, A. Ky-rola, H. V. Simhadri, and K. Tangwongsan. Brief announcement: the problem based benchmark suite. In Proc. ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 68-70, 2012.
26. S. Suri and S. Vassilvitskii. Counting triangles and the curse of the last reducer. In Proc. 20th International Conference on World Wide Web (WWW), pages 607-614, 2011.
27. K. Tangwongsan, A. Pavan, and S. Tirthapura. Parallel triangle counting in massive streaming graphs. CoRR, abs/1308, 2013.
28. C. E. Tsourakakis, U. Kang, G. L. Miller, and C. Faloutsos. Doulion: counting triangles in massive graphs with a coin. In Proc. ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pages 837-846, 2009.
29. C. E. Tsourakakis, P. Drineas, E. Michelakis, I. Koutis, and C. Faloutsos. Spectral counting of triangles via element-wise sparsification and triangle-based link recommendation. Social Netw. Analys. Mining, 1(2):75-81, 2011.
30. S. Wasserman and K. Faust. Social Network Analysis. Cam-bridage University Press, 1994.