The Input/Output Complexity of Triangle Enumeration
Summary: Randomized cache-oblivious algorithm enumerates all triangles in an undirected graph in O(E^{3/2}/√(M B)) expected I/Os (deterministic cache-aware variant when M ≥ E^ε), improving prior bounds. Proves tight I/O lower bound Ω(t/√(M B)) (worst-case t = Θ(E^{3/2})), and introduces a new color-coding technique for I/O-efficient listing. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,201 | Subgraph Matching: on Compression and Computation | 2018 | VLDB | 9.0257706e-05 |
| 3,285 | Output-optimal Parallel Algorithms for Similarity Joins | 2017 | PODS | 7.6214506e-05 |
| 4,167 | Instance and Output Optimal Parallel Algorithms for Acyclic Joins | 2019 | PODS | 6.9219382e-05 |
| 4,453 | Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage | 2018 | VLDB | 6.7506837e-05 |
| 4,952 | Join Dependency Testing, Loomis-Whitney Join, and Triangle Enumeration | 2015 | PODS | 6.4959657e-05 |
| 5,371 | I/O-Efficient Butterfly Counting at Scale | 2023 | SIGMOD | 6.3147556e-05 |
| 5,502 | Towards a Worst-Case I/O-Optimal Algorithm for Acyclic Joins | 2016 | PODS | 6.2633287e-05 |
| 6,662 | 2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection | 2017 | PODS | 5.8693057e-05 |
| 8,336 | Output-Optimal Algorithms for Join-Aggregate Queries | 2025 | PODS | 5.5054784e-05 |
| 11,440 | Two-Attribute Skew Free, Isolated CP Theorem, and Massively Parallel Joins | 2021 | PODS | 5.1725247e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 602 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00015983188 |
| 1,515 | Upper and Lower Bounds on the Cost of a Map-Reduce Computation | 2013 | VLDB | 0.00010586859 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,241 | Efficiently Counting Triangles in Large Temporal Graphs | 2025 | SIGMOD | 5.3572577e-05 |
| 4,453 | Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage | 2018 | VLDB | 6.7506837e-05 |
| 8,622 | How the Degeneracy Helps for Triangle Counting in Graph Streams | 2020 | PODS | 5.4598872e-05 |
| 1,178 | Counting and Sampling Triangles from a Graph Stream | 2013 | VLDB | 0.00011907399 |
| 6,662 | 2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection | 2017 | PODS | 5.8693057e-05 |
| 454 | Counting Triangles in Data Streams | 2006 | PODS | 0.00018243292 |
| 4,930 | Better Algorithms for Counting Triangles in Data Streams | 2016 | PODS | 6.5040855e-05 |
| 9,194 | Efficiently Enumerating Minimal Triangulations | 2017 | PODS | 5.3706236e-05 |
| 8,628 | On Asymptotic Cost of Triangle Listing in Random Graphs | 2017 | PODS | 5.4598872e-05 |
| 602 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00015983188 |