An efficient exact algorithm for triangle listing in large graphs

DOI10.1007/s10618-016-0451-4zbMath1411.68086OpenAlexW2269681615MaRDI QIDQ1741284

Hamida Seba, Sofiane Lagraa

Publication date: 3 May 2019

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10618-016-0451-4

zbMATH Keywords

graph compressionlarge graphstriangle listing

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Summarized bit batch-based triangle listing in massive graphs, Parameterized aspects of triangle enumeration

Uses Software

• SNAP
• STRING
• WebGraph
• DOULION

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of the algorithmic aspects of modular decomposition
• A distance measure for large graphs based on prime graphs
• Main-memory triangle computations for very large (sparse (power-law)) graphs
• Fast algorithms for determining (generalized) core groups in social networks
• Efficient and Practical Algorithms for Sequential Modular Decomposition
• Arboricity and Subgraph Listing Algorithms
• Finding a Minimum Circuit in a Graph
• Listing Triangles
• Triangle Listing Algorithms: Back from the Diversion
• PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT
• Algorithm Theory - SWAT 2004
• Transitiv orientierbare Graphen
• Experimental and Efficient Algorithms
• Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning