Efficient algorithms for large-scale local triangle counting

ACM Transactions on Knowledge Discovery from Data

Volumn 4, Issue 3, 2010, Pages

  Becchetti, Luca ^a   Boldi, Paolo ^b   Castillo, Carlos ^c   Gionis, Aristides ^c  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF MILAN   (Italy)

^c YAHOO RESEARCH   (Spain)

Author keywords

Clustering coefficient; Massive graph computing; Social networks; Web com puting

Indexed keywords

CLUSTERING COEFFICIENT; CONTENT QUALITIES; DIRECTED GRAPHS; EFFICIENT ALGORITHM; EXTERNAL MEMORY; LARGE GRAPHS; LOCAL CLUSTERING; MAIN MEMORY; MASSIVE GRAPH; MASSIVE-GRAPH COMPUTING; MIN-WISE INDEPENDENT PERMUTATIONS; NUMBER OF TRIANGLES; SOCIAL NETWORKS; WEB GRAPHS; WEB-COM;

DRUG PRODUCTS PLANTS; GRAPHIC METHODS; SOCIAL NETWORKING (ONLINE);

APPROXIMATION ALGORITHMS;

EID: 78049335266     PISSN: 15564681     EISSN: 1556472X     Source Type: Journal    
DOI: 10.1145/1839490.1839494     Document Type: Article

References (42)

1. ALON, N., YUSTER, R., AND ZWICK, U. 1997. Finding and counting given length cycles. Algorithmica 17, 3, 209-223.
2. BAR-YOSSEF, Z., KUMAR, R., AND SIVAKUMAR, D. 2002. Reductions in streaming algorithms, with an application to counting triangles in graphs. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Mathematics (SODA). 623-632.
3. BATAGELJ, V. AND MRVAR, A. 2001. A subquadratic triad census algorithm for large sparse networks with small maximum degree. Social Netw. 23, 237-243.
4. BECCHETTI, L., BOLDI, P., CASTILLO, C., AND GIONIS, A. 2008. Efficient semi-streaming algorithms for local triangle counting in massive graphs. In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 16-24.
5. BOHMAN, T., COOPER, C., AND FRIEZE, A. M. 2000. Min-wise independent linear permutations. Electronic J. Combinat. 7.
6. BOLDI, P. AND VIGNA, S. 2004. The webgraph framework I: compression techniques. In Proceedings of the 13th International Conference on World Wide Web. 595-602.
7. BORDINO, I., DONATO, D., GIONIS, A., AND LEONARDI, S. 2008. Mining large networks with subgraph counting. In Proceedings of the IEEE International Conference on Data Mining (ICDM). 737-742.
8. BOYKIN, P. O. AND ROYCHOWDHURY, V. P. 2005. Leveraging social networks to fight spam. Computer 38, 4, 61-68.
9. BRODER, A. Z. 1998. On the resemblance and containment of documents. In Proceedings of the Compression and Complexity of Sequences, IEEE Computer Society. 21-29.
10. BRODER, A. Z. 2000. Identifying and filtering near-duplicate documents. In Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching (CPM). 1-10.
11. BRODER, A. Z., CHARIKAR, M., FRIEZE, A. M., AND MITZENMACHER, M. 1998. Min-wise independent permutations (extended abstract). In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC). 327-336.
12. BRODER, A. Z., GLASSMAN, S. C., MANASSE, M. S., AND ZWEIG, G. 1997. Syntactic clustering of the web. In Proceedings of the 6th International Conference on World Wide Web. Elsevier Science Publishers Ltd., 1157-1166.
13. BURIOL, L. S., FRAHLING, G., LEONARDI, S., MARCHETTI-SPACCAMELA, A., AND SOHLER, C. 2006. Counting triangles in data streams. In Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS). 253-262.
14. BURIOL, L. S., FRAHLING, G., LEONARDI, S., AND SOHLER, C. 2007. Estimating clustering indexes in data streams. In Proceedings of the 15th Annual European Symposium on Algorithms. 618-632.
15. CASTILLO, C., DONATO, D., BECCHETTI, L., BOLDI, P., LEONARDI, S., SANTINI, M., AND VIGNA, S. 2006. A reference collection for web spam. SIGIR Forum 40, 2, 11-24.
16. CASTILLO, C., DONATO, D., GIONIS, A., MURDOCK, V., AND SILVESTRI, F. 2007. Know your neighbors: Web spam detection using the web topology. In Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. 423-430.
17. COPPERSMITH, D. AND KUMAR, R. 2004. An improved data stream algorithm for frequency moments. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 151-156.
18. COPPERSMITH, D. AND WINOGRAD, S. 1990. Matrix multiplication via arithmetic progressions. J. Symb. Computat. 9, 3, 251-280.
19. DE GRAAF, M., SCHRIJVER, A., AND SEYMOUR, P. D. 1992. Directed triangles in directed graphs. Discr. Math. 110, 1-3, 279-282.
20. DEMETRESCU, C., FINOCCHI, I., AND RIBICHINI, A. 2006. Trading off space for passes in graph streaming problems. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 714-723.
21. ECKMANN, J.-P. AND MOSES, E. 2002. Curvature of co-links uncovers hidden thematic layers in the world wide web. In Proceedings of the National Academy of Sciences (PNAS) 99, 9, 5825-5829.
22. FEIGENBAUM, J., KANNAN, S., GREGOR, M. A., SURI, S., AND ZHANG, J. 2004. On graph problems in a semi-streaming model. In Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP). 207-216.
23. FETTERLY, D., MANASSE, M., AND NAJORK, M. 2004. Spam, damn spam, and statistics: Using statistical analysis to locate spam web pages. In Proceedings of the 7th Workshop on the Web and Databases (WebDB). 1-6.
24. FOGARAS, D. AND RÁCZ, B. 2005. Scaling link-based similarity search. In Proceedings of the 14th International Conference on World Wide Web. 641-650.
25. GIBSON, D., KUMAR, R., AND TOMKINS, A. 2005. Discovering large dense subgraphs in massive graphs. In Proceedings of the 31st International Conference on Very Large Data Bases (VLDB). 721-732.
26. GULLI, A. AND SIGNORINI, A. 2005. The indexable Web is more than 11.5 billion pages. In Poster Proceedings of the 14th International Conference on World Wide Web. 902-903.
27. HAVELIWALA, T. 1999. Efficient computation of pagerank. Tech. Rep., Stanford University.
28. HENZINGER, M. R., RAGHAVAN, P., AND RAJAGOPALAN, S. 1999. Computing on data streams. Dimacs Series in Discrete Mathematics and Theoretical Computer Science, 107-118.
29. HOLME, P., EDLING, C., AND LILJEROS, F. 2004. Structure and time-evolution of an internet dating community. Soc. Netw. 26, 155.
30. INDYK, P. 1999. A small approximately min-wise independent family of hash functions. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 454-456.
31. ITAI, A. AND RODEH, M. 1978. Finding a minimum circuit in a graph. SIAM J. Comput. 7, 4, 413-423.
32. JEH, G. AND WIDOM, J. 2002. Simrank: A measure of structural-context similarity. In KDD'02: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM Press, New York, 538-543.
33. KUMAR, R., RAGHAVAN, P., RAJAGOPALAN, S., AND TOMKINS, A. 1999. Trawling the Web for emerging cyber-communities. Comput. Netwo. 31, 11-16, 1481-1493.
34. LATAPY, M. 2008. Main-memory triangle computations for very large (sparse (power-law)) graphs. Theoret. Comput. Sci. 407, 1-3, 458-473.
35. LATAPY, M. AND MAGNIEN, C. 2006. Measuring fundamental properties of real-world complex networks. arXiv:cs/0609115v2.
36. LESKOVEC, J., KLEINBERG, J., AND FALOUTSOS, C. 2005. Graphs over time: densification laws, shrinking diameters and possible explanations. In Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery in Data Mining. 177-187.
37. MITZENMACHER, M. AND UPFAL, E. 2005. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press.
38. NEWMAN, M. E. J. 2003. The structure and function of complex networks. SIAM Review 45, 2, 167-256.
39. SCHANK, T. AND WAGNER, D. 2005. Finding, counting and listing all triangles in large graphs, an experimental study. In Proceedings of the 4th International Workshop on Experimental and Efficient Algorithms (WEA).
40. TSOURAKAKIS, C. E. 2008. Fast counting of triangles in large real networks without counting: Algorithms and laws. In ICDM'08: Proceedings of the 2008 8th IEEE International Conference on Data Mining. IEEE Computer Society, Press, Los Alamitos, CA, 608-617.
41. VITTER, J. S. 2001. External memory algorithms and data structures. ACM Comput. Surveys 33, 2, 209-271.
42. WELSER, H. T., GLEAVE, E., FISHER, D., AND SMITH, M. 2007. Visualizing the signatures of social roles in online discussion groups. J. Soc. Struct. 8, 2.