Data Mining and Knowledge Discovery

, Volume 30, Issue 5, pp 1350–1369 | Cite as

An efficient exact algorithm for triangle listing in large graphs

Article

Abstract

This paper presents a new efficient exact algorithm for listing triangles in a large graph. While the problem of listing triangles in a graph has been considered before, dealing with large graphs continues to be a challenge. Although previous research has attempted to tackle the challenge, this is the first contribution that addresses this problem on a compressed copy of the input graph. In fact, the proposed solution lists the triangles without decompressing the graph. This yields interesting improvements in both storage requirement of the graphs and their time processing.

Keywords

Triangle listing Large graphs Graph compression 

References

  1. Batagelj V, Zaversnik MZ (2011) Fast algorithms for determining (generalized) core groups in social networks. Adv Data Anal Classif 5(2):129–145MathSciNetCrossRefMATHGoogle Scholar
  2. Becchetti L, Boldi P, Castillo C, Gionis A (2010) Efficient algorithms for large-scale local triangle counting. ACM Trans Knowl Discov Data 4(3):13:1–13:28. doi:10.1145/1839490.1839494 CrossRefGoogle Scholar
  3. Björklund A, Pagh R, Williams V, Zwick U (2014) Listing triangles. In: Esparza J, Fraigniaud P, Husfeldt T, Koutsoupias E (eds) Automata, languages, and programming. Lecture notes in computer science. Springer, Berlin, pp 223–234. doi:10.1007/978-3-662-43948-7_19
  4. Boldi P, Vigna S (2004) The webgraph framework i: Compression techniques. In: Proceedings of the 13th international conference on world wide web, WWW ’04, pp 595–602. ACM, New York doi:10.1145/988672.988752
  5. Bonnici V, Giugno R, Pulvirenti A, Shasha D, Ferro A (2013) A subgraph isomorphism algorithm and its application to biochemical data. BMC Bioinform 14:S13CrossRefGoogle Scholar
  6. Capelle C, Habib M, de Montgolfier F (2002) Graph decompositions and factorizing permutations. Discret Math Theor Comput Sci 5(1):55–70MathSciNetMATHGoogle Scholar
  7. Chen C, Lin CX, Fredrikson M, Christodorescu M, Yan X, Han J (2009) Mining graph patterns efficiently via randomized summaries. Proc VLDB Endow 2(1):742–753. doi:10.14778/1687627.1687711 CrossRefGoogle Scholar
  8. Chiba N, Nishizeki T (1985) Arboricity and subgraph listing algorithms. SIAM J Comput 14(1):210–223. doi:10.1137/0214017 MathSciNetCrossRefMATHGoogle Scholar
  9. Chu S, Cheng J (2012) Triangle listing in massive networks. ACM Trans Knowl Discov Data 6(4):17:1–17:32. doi:10.1145/2382577.2382581 CrossRefGoogle Scholar
  10. Cowan D, James I, Stanton R (1972) Graph decomposition for undirected graphs. In: 3rd S-E conference on combinatorics, graph theory and computing, pp 281–290Google Scholar
  11. Dahlhaus E, Gustedt J, McConnell RM (2001) Efficient and practical algorithms for sequential modular decomposition. J Algorithms 41(2):360–387. doi:10.1006/jagm.2001.1185. http://www.sciencedirect.com/science/article/pii/S019667740191185X
  12. Dementiev R (2006) Algorithm engineering for large data sets hardware, software, algorithms. Ph.D. thesis, Saarland University, SaarbruckenGoogle Scholar
  13. de Montgolfier F (2003) Modular decomposition of graphs: theory, extensions and algorithms. Ph.D. thesis, Université des Sciences et Techniques du Languedoc, MontpellierGoogle Scholar
  14. Fan W, Li J, Wang X, Wu Y (2012) Query preserving graph compression. In: Proceedings of the 2012 ACM SIGMOD international conference on management of data, SIGMOD ’12, pp 157–168. ACM, New York. doi:10.1145/2213836.2213855
  15. Gallai T (1967) Transitiv orientierbare graphen. Acta Math Hung 18:25–66MathSciNetCrossRefMATHGoogle Scholar
  16. Habib M, de Montgolfier F, Paul C (2004) A simple linear-time modular decomposition algorithm for graphs, using order extension. In: Proceedings of the algorithm theory—SWAT 2004, 9th Scandinavian workshop on algorithm theory, Humlebaek, Denmark, 8–10 July 2004, pp 187–198Google Scholar
  17. Habib M, Paul C (2010) A survey of the algorithmic aspects of modular decomposition. Comput Sci Rev 4(1):41–59CrossRefMATHGoogle Scholar
  18. Habib M, Paul C, Viennot L (1999) Partition refinement techniques: an interesting algorithmic tool kit. Int J Found Comput Sci 10(2):147–170MathSciNetCrossRefMATHGoogle Scholar
  19. Hu X, Tao Y, Chung CW (2013) Massive graph triangulation. In: Proceedings of the 2013 ACM SIGMOD international conference on management of data, SIGMOD ’13, pp 325–336. ACM, New York. doi:10.1145/2463676.2463704
  20. Itai A, Rodeh M (1978) Finding a minimum circuit in a graph. SIAM J Comput 7(4):413–423MathSciNetCrossRefMATHGoogle Scholar
  21. Kolountzakis MN, Miller G, Peng R, Tsourakakis CE (2010) Efficient triangle counting in large graphs via degree-based vertex partitioning. In: Kumar R, Sivakumar D (eds) Algorithms and models for the web-graph. Lecture notes in computer science. Springer, Berlin, pp 15–24. doi:10.1007/978-3-642-18009-5_3
  22. Lagraa S, Seba H, Khennoufa R, M’Baya A, Kheddouci H (2014) A distance measure for large graphs based on prime graphs. Pattern Recognit 47(9):2993–3005CrossRefMATHGoogle Scholar
  23. Latapy M (2008) Main-memory triangle computations for very large (sparse (power-law)) graphs. Theor Comput Sci 407(1–3):458–473MathSciNetCrossRefMATHGoogle Scholar
  24. Leskovec J, Krevl A (2014) SNAP Datasets: Stanford large network dataset collection. http://snap.stanford.edu/data
  25. Mcconnell RM, Spinrad JP (2000) Ordered vertex partitioning. Discret Math Theor Comput Sci 4(1). http://dmtcs.episciences.org/274
  26. Möhring R (1985) Algorithmic aspect of the substitution decomposition in optimization over relation, set system and boolean function. Ann Oper Res 4:195–225MathSciNetCrossRefGoogle Scholar
  27. Möhring R, Radermacher F (1984) Substitution decomposition and connection with combinatorial optimization. Ann Discret Math 19:257–356MATHGoogle Scholar
  28. Ortmann M, Brandes U (2014) Triangle listing algorithms: Back from the diversion. In: 2014 proceedings of the sixteenth workshop on algorithm engineering and experiments, ALENEX 2014, Portland, Oregon, USA, 5 Jan 2014, pp 1–8Google Scholar
  29. Schank T (2007) Algorithmic aspects of triangle-based network analysis. Ph.D. thesis, Universität Karlsruhe, KarlsruheGoogle Scholar
  30. Schank T, Wagner D (2005) Finding, counting and listing all triangles in large graphs, an experimental study. In: Proceedings of the 4th International conference on experimental and efficient algorithms, WEA’05, pp 606–609. Springer-Verlag, Berlin, Heidelberg. doi:10.1007/11427186_54
  31. Szklarczyk D, Franceschini A, Kuhn M, Simonovic M, Roth A, Minguez P, Doerks T, Stark M, Muller J, Bork P, Jensen L, Mering CV (2011) The string database in 2011: functional interaction networks of proteins, globally integrated and scored. Nucleic Acids Res 39:D561–D568CrossRefGoogle Scholar
  32. Tedder M, Corneil D, Habib M, Paul C (2008) Simpler linear-time modular decomposition via recursive factorizing permutations. In: Aceto L, Damgrd I, Goldberg L, Halldrsson M, Inglfsdttir A, Walukiewicz I (eds) Automata, languages and programming. Lecture notes in computer science. Springer, Berlin, pp 634–645. doi:10.1007/978-3-540-70575-8_52
  33. Tsourakakis CE, Kang U, Miller GL, Faloutsos C (2009) Doulion: counting triangles in massive graphs with a coin. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining, KDD ’09, pp 837–846. ACM, New York. doi:10.1145/1557019.1557111

Copyright information

© The Author(s) 2016

Authors and Affiliations

  1. 1.Université Grenoble Alpes, CNRS, TIMA, LIGGrenobleFrance
  2. 2.Université de Lyon, CNRS, Université Lyon 1, LIRIS, UMR5205VilleurbanneFrance

Personalised recommendations