The Complexity of Counting Cycles in the Adjacency List Streaming Model
Summary: Characterizes sublinear-space complexity of cycle counting in the adjacency-list streaming model: provides a two-pass triangle estimator using Õ(m / T^{2/3}) space. Proves no sublinear multipass algorithms for l-cycles (l≥5); 4-cycles are intermediate—sublinear in multipass but impossible in single-pass. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. John Kallaugher
- 2. Andrew McGregor
- 3. Eric Price
- 4. Sofya Vorotnikova
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,864 | Triangle and Four Cycle Counting in the Data Stream Model | 2020 | PODS | 4.9050236e-05 |
| 7,317 | Accurate and Fast Approximate Graph Pattern Mining at Scale | 2025 | VLDB | 4.7639399e-05 |
| 10,342 | An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs Using Fast Matrix Multiplication | 2025 | PODS | 4.1945683e-05 |
| 11,321 | Approximately Counting Subgraphs in Data Streams | 2022 | PODS | 4.1945683e-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 |
|---|---|---|---|---|
| 392 | Counting Triangles in Data Streams | 2006 | PODS | 0.00024556183 |
| 1,344 | Counting and Sampling Triangles from a Graph Stream | 2013 | VLDB | 0.00012473724 |
| 5,046 | Better Algorithms for Counting Triangles in Data Streams | 2016 | PODS | 5.7405307e-05 |
Previous
Page 1 / 1
Next