How the Degeneracy Helps for Triangle Counting in Graph Streams
Summary: Constant-pass streaming algorithm for (1±ε)-triangle counting with space O(m·κ/T), leveraging graph degeneracy κ to significantly improve upon prior m^{3/2}/T and m/√T bounds for low-degeneracy families (e.g., planar, minor-closed, preferential-attachment). Proven nearly-matching lower bound Ω(m·κ/T). (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Suman K. Bera
- 2. C. Seshadhri
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,323 | Approximately Counting Subgraphs in Data Streams | 2022 | PODS | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 389 | Counting Triangles in Data Streams | 2006 | PODS | 0.00024649634 |
| 1,348 | Counting and Sampling Triangles from a Graph Stream | 2013 | VLDB | 0.00012461666 |
| 5,043 | Better Algorithms for Counting Triangles in Data Streams | 2016 | PODS | 5.7350154e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,088 | Efficiently Enumerating Minimal Triangulations | 2017 | PODS | 4.3940132e-05 |
| 2,219 | The Input/Output Complexity of Triangle Enumeration | 2014 | PODS | 9.2653868e-05 |
| 6,864 | Triangle and Four Cycle Counting in the Data Stream Model | 2020 | PODS | 4.9003179e-05 |
| 3,067 | Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges | 2021 | SIGMOD | 7.6247945e-05 |
| 4,883 | Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage | 2018 | VLDB | 5.8519327e-05 |
| 6,463 | The Complexity of Counting Cycles in the Adjacency List Streaming Model | 2019 | PODS | 5.0477915e-05 |
| 389 | Counting Triangles in Data Streams | 2006 | PODS | 0.00024649634 |
| 1,348 | Counting and Sampling Triangles from a Graph Stream | 2013 | VLDB | 0.00012461666 |
| 11,323 | Approximately Counting Subgraphs in Data Streams | 2022 | PODS | 4.1905499e-05 |
| 5,043 | Better Algorithms for Counting Triangles in Data Streams | 2016 | PODS | 5.7350154e-05 |