Triangle listing in massive networks

ACM Transactions on Knowledge Discovery from Data

Volumn 6, Issue 4, 2012, Pages

  Chu, Shumo ^a   Cheng, James ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Clustering coefficients; Large graphs; Massive networks; Triangle counting; Triangle listing

Indexed keywords

CLUSTERING COEFFICIENT; LARGE GRAPHS; MASSIVE NETWORKS; TRIANGLE COUNTING; TRIANGLE LISTING;

COMPUTER SCIENCE; DATA MINING;

APPROXIMATION ALGORITHMS;

EID: 84866038305     PISSN: 15564681     EISSN: 1556472X     Source Type: Journal    
DOI: 10.1145/2382577.2382581     Document Type: Conference Paper

References (42)

1. ABOU-RJEILI, A. AND KARYPIS, G. 2006. Multilevel algorithms for partitioning power-law graphs. In Proceedings of the IEEE International Parallel and Distributed Processing Symposium (IPDPS'06).
2. AGGAARWAL, A. AND VITTER, J. S. 1988. The input/output complexity of sorting and related problems. Comm. ACM 31, 9, 1116-1127.
3. ALON, N.,MATIAS, Y., AND SZEGEDY, M. 1999. The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58, 1, 137-147.
4. ALON, N., YUSTER, R., AND ZWICK, U. 1997. Finding and counting given length cycles. Algorithmica 17, 3, 354-364.
5. ANDREEV, K. AND RACKE, H. 2004. Balanced graph partitioning. In Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'04). 120-124.
6. 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 ACM/SIAM Annual Symposium on Discrete Algorithms (SODA'02). 623-632.
7. BATAGELJ, V. ANDMRVAR, A. 2001. A subquadratic triad census algorithm for large sparse networks with small maximum degree. Social Netw. 23, 3, 237-243.
8. BATAGELJ, V. AND ZAVERSNIK, M. 2007. Short cycle connectivity. Discr. Math. 307, 3-5, 310-318.
9. 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 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'08). 16-24.
10. BECCHETTI, L., BOLDI, P., CASTILLO, C., AND GIONIS, A. 2010. Efficient algorithms for large-scale local triangle counting. ACM Trans. Knowl. Discov. Data 4, 3.
11. BUEHRER, G. AND CHELLAPILLA, K. 2008. A scalable pattern mining approach to web graph compression with communities. In Proceedings of the International Conference on Web Search and Web Data Mining (WSDM'08). 95-106.
12. BURIOL, L. S., FRAHLING, G., LEONARDI, S.,MARCHETTI-SPACCAMELA, A., AND SOHLER, C. 2006. Counting triangles in data streams. In Proceedings of the ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS'06). 253-262.
13. CHENG, J., KE, Y., CHU, S., AND ÖZSU, M. T. 2011a. Efficient core decomposition in massive networks. In Proceedings of the International Conference on Data Engineering (ICDE'11). 51-62.
14. CHENG, J., KE, Y., FU, A. W.-C., YU, J. X., AND ZHU, L. 2010. Finding maximal cliques in massive networks by h*-graph. In Proceedings of the ACM SIGMOD Conference on Management of Data. 447-458.
15. CHENG, J., KE, Y., FU, A. W.-C., YU, J. X., AND ZHU, L. 2011b. Finding maximal cliques in massive networks. ACM Trans. Datab. Syst. 36, 4, 21.
16. CHU, S. AND CHENG, J. 2011. Triangle listing in massive networks and its applications. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'11). 672-680.
17. COHEN, J. 2009. Graph twiddling in a mapreduce world. Comput. Sci. Engin. 11, 29-41.
18. COPPERSMITH, D. AND KUMAR, R. 2004. An improved data stream algorithm for frequency moments. In Proceedings of the ACM SIGMOD-SIGACT-SIGART Annual Symposium on Discrete Algorithms (SODA'04). 151-156.
19. ECKMANN, J.-P. AND MOSES, E. 2002. Curvature of co-links uncovers hidden thematic layers in the world wide web. Proc. Nat. Acad. Sci. 99, 5825-5829.
20. EPPSTEIN, D. AND SPIRO, E. S. 2009. The h-index of a graph and its application to dynamic subgraph statistics. In Proceedings of the Workshop on Algorithms and Data Structures (WADS'09). 278-289.
21. FALOUTSOS, M., FALOUTSOS, P., AND FALOUTSOS, C. 1999. On power-law relationships of the internet topology. In Proceedings of the ACMSIGCOMMConference on Applications, Technologies, Architectures and Protocols for Computer Communications. 251-262.
22. FEIGE, U. AND KRAUTHGAMER, R. 2000. A polylogarithmic approximation of the minimum bisection. In Proceedings of the IEEE Annual Symposium on Foundations of Computer Science (FOCS'00). 105-115.
23. FEIGE, U., KRAUTHGAMER, R., AND NISSIM, K. 2000. Approximating the minimum bisection size (extended abstract). In Proceedings of the Symposium on Theory of Computing (STOC'00). 530-536.
24. FIDUCCIA, C. M. AND MATTHEYSES, R. M. 1982. A linear time heuristic for improving network partitions. In Proceedings of the IEEE Design Automation Conference.
25. FRITZKE, B. 1993. A self-organizing network for unsupervised learning. Tech. rep. TR-03-026 42.
26. GRANOVETTER, M. 1973. The strength of weak ties. Amer. J. Sociol. 78, 6, 1360-1380.
27. ITAI, A. AND RODEH, M. 1977. Finding a minimum circuit in a graph. In Proceedings of the Symposium on Theory of Computing (STOC'77). 1-10.
28. ITAI, A. AND RODEH, M. 1978. Finding a minimum circuit in a graph. SIAM J. Comput. 7, 4, 413-423.
29. KARYPIS, G. AND KUMAR, V. 1999. Parallel multilevel k-way partitioning for irregular graphs. SIAM Rev. 41, 2, 278-300.
30. KERNIGHAM, B. W. AND LIN, S. 1970. An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49, 2, 291-308.
31. LATAPY, M. 2008. Main-Memory triangle computations for very large (sparse (power-law)) graphs. Theor. Comput. Sci. 407, 1-3, 458-473.
32. MILO, R., SHEN-ORR, S., ITZKOVITZ, S., KASHTAN, N., CHKLOVSKII, D., AND ALON, U. 2002. Network motifs: Simple building blocks of complex networks. Science 298, 5594, 824-827.
33. NEWMAN, M. E. J. 2003. The structure and function of complex networks. SIAM Rev. 45, 2, 167-256.
34. NEWMAN, M. E. J.,WATTS, D. J., AND STROGATZ, S. H. 2002. Random graph models of social networks. Proc. Nat. Acad. Sci. 99, 2566-2572.
35. SCHANK, T. 2007. Algorithmic aspects of triangle-based network analysis. Ph.D. dissertation, Universität Karlsruhe, Fakultät für Informatik.
36. SCHANK, T. AND WAGNER, D. 2005. Finding, counting and listing all triangles in large graphs, an experimental study. In Proceedings of the WEA Conference. 606-609.
37. SURI, S. AND VASSILVITSKII, S. 2011. Counting triangles and the curse of the last reducer. In Proceedings of the International Conference on the World Wide Web (WWW'11). 607-614.
38. TAUBIN, G. AND ROSSIGNAC, J. 1998. Geometric compression through topological surgery. ACM Trans. Graph. 17, 2, 84-115.
39. TSOURAKAKIS, C. E., KANG, U.,MILLER, G. L., AND FALOUTSOS, C. 2009. Doulion: Counting triangles in massive graphs with a coin. In Proceedings of the ACMSIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'09). 837-846.
40. WANG, N., ZHANG, J., TAN, K.-L., AND TUNG, A. K. H. 2010. On triangulation-based dense neighborhood graphs discovery. Proc. VLDB 4, 2, 58-68.
41. WASSERMAN, S. AND FAUST, K. 1994. Social Network Analysis: Methods and Applications. Cambridge University Press.
42. WATTS, D. J. AND STROGATZ, S. H. 1998. Collective dynamics of 'small-world' networks. Nature 393, 6684, 440-442.