An efficient exact algorithm for triangle listing in large graphs

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.

[1]  Matthieu Latapy,et al.  Main-memory triangle computations for very large (sparse (power-law)) graphs , 2008, Theor. Comput. Sci..

[2]  Dennis Shasha,et al.  A subgraph isomorphism algorithm and its application to biochemical data , 2013, BMC Bioinformatics.

[3]  Jeremy P. Spinrad,et al.  Ordered Vertex Partitioning , 2000, Discret. Math. Theor. Comput. Sci..

[4]  Christos Faloutsos,et al.  DOULION: counting triangles in massive graphs with a coin , 2009, KDD.

[5]  Luca Becchetti,et al.  Efficient algorithms for large-scale local triangle counting , 2010, TKDD.

[6]  Jure Leskovec,et al.  {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .

[7]  Sebastiano Vigna,et al.  The webgraph framework I: compression techniques , 2004, WWW '04.

[8]  K.-H. Bachmann.  Automata, Languages and Programming, 2nd Colloquium, Univ. of Saarbrücken, 29. 7. - 2. 8. 1974, Hrsg. Loeckx, J., Berlin-Heidelberg-New York. Springer-Verlag. 1974. 619 S., DM 48,-. US $ 19.60. (Lecture Notes in Computer Science, Bd. 14.) , 1977 .

[9]  Alon Itai,et al.  Finding a minimum circuit in a graph , 1977, STOC '77.

[10]  Michel Habib,et al.  Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations , 2008, ICALP.

[11]  Thomas Schank,et al.  Algorithmic Aspects of Triangle-Based Network Analysis , 2007 .

[12]  Mihail N. Kolountzakis,et al.  Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning , 2010, Internet Math..

[13]  Damian Szklarczyk,et al.  The STRING database in 2011: functional interaction networks of proteins, globally integrated and scored , 2010, Nucleic Acids Res..

[14]  Roman Dementiev.  Algorithm engineering for large data sets: hardware, software, algorithms , 2007 .

[15]  Michel Habib,et al.  A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension , 2004, SWAT.

[16]  Norishige Chiba,et al.  Arboricity and Subgraph Listing Algorithms , 1985, SIAM J. Comput..

[17]  Michel Habib,et al.  Graph decompositions and factorizing permutations , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.

[18]  Hamamache Kheddouci,et al.  A distance measure for large graphs based on prime graphs , 2014, Pattern Recognit..

[19]  Uri Zwick,et al.  Listing Triangles , 2014, ICALP.

[20]  Ulrik Brandes,et al.  Triangle Listing Algorithms: Back from the Diversion , 2014, ALENEX.

[21]  Michel Habib,et al.  A survey of the algorithmic aspects of modular decomposition , 2009, Comput. Sci. Rev..

[22]  Yufei Tao,et al.  Massive graph triangulation , 2013, SIGMOD '13.

[23]  Dorothea Wagner,et al.  Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study , 2005, WEA.

[24]  F. Radermacher,et al.  Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization , 1984 .

[25]  Laurent Viennot,et al.  Partition Refinement Techniques: An Interesting Algorithmic Tool Kit , 1999, Int. J. Found. Comput. Sci..

[26]  T. Gallai.  Transitiv orientierbare Graphen , 1967 .

[27]  Jiawei Han,et al.  Mining Graph Patterns Efficiently via Randomized Summaries , 2009, Proc. VLDB Endow..

[28]  Vladimir Batagelj,et al.  Fast algorithms for determining (generalized) core groups in social networks , 2011, Adv. Data Anal. Classif..

[29]  R. Möhring.  Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and Boolean functions , 1985 .

[30]  Xin Wang,et al.  Query preserving graph compression , 2012, SIGMOD Conference.

[31]  James Cheng,et al.  Triangle listing in massive networks , 2012, TKDD.

[32]  Jens Gustedt,et al.  Efficient and Practical Algorithms for Sequential Modular Decomposition , 2001, J. Algorithms.