Better Algorithms for Counting Triangles in Data Streams
Summary: Tightens space for 1+ε triangle-count approximation in streams: adjacency-list model achieves O~(ε^{-2} m / sqrt(T)) in one pass and O~(ε^{-2} m^{3/2} / T) in two passes; arbitrary-order achieves O~(ε^{-2} m / T) in two passes and O~(ε^{-2} m^{3/2} / T) in three passes (with degree oracle). Introduces an efficient wedge-sampling implementation via the first multi-sample l_p sampling algorithm with O(polylog n) update time, a broadly applicable primitive. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Andrew McGregor
- 2. Sofya Vorotnikova
- 3. Hoa T. Vu
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,236 | The Complexity of Counting Cycles in the Adjacency List Streaming Model | 2019 | PODS | 6.0070757e-05 |
| 6,619 | Triangle and Four Cycle Counting in the Data Stream Model | 2020 | PODS | 5.8801548e-05 |
| 8,622 | How the Degeneracy Helps for Triangle Counting in Graph Streams | 2020 | PODS | 5.4598872e-05 |
| 9,804 | Automating Incremental Graph Processing with Flexible Memoization | 2021 | VLDB | 5.2708329e-05 |
| 10,354 | An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs Using Fast Matrix Multiplication | 2025 | PODS | 5.1725247e-05 |
| 11,323 | Approximately Counting Subgraphs in Data Streams | 2022 | PODS | 5.1725247e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 454 | Counting Triangles in Data Streams | 2006 | PODS | 0.00018243292 |
| 1,178 | Counting and Sampling Triangles from a Graph Stream | 2013 | VLDB | 0.00011907399 |
| 1,245 | Tight Bounds for Lp Samplers, Finding Duplicates in Streams, and Related Problems | 2011 | PODS | 0.00011576632 |
| 1,339 | Graph Sketches: Sparsification, Spanners, and Subgraphs | 2012 | PODS | 0.0001120043 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,123 | Triangle Counting in Hypergraph Streams: A Complete and Practical Approach | 2026 | SIGMOD | 5.1725247e-05 |
| 4,540 | On Sampling from Massive Graph Streams | 2017 | VLDB | 6.7090838e-05 |
| 11,323 | Approximately Counting Subgraphs in Data Streams | 2022 | PODS | 5.1725247e-05 |
| 2,736 | Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges | 2021 | SIGMOD | 8.2521847e-05 |
| 6,236 | The Complexity of Counting Cycles in the Adjacency List Streaming Model | 2019 | PODS | 6.0070757e-05 |
| 8,622 | How the Degeneracy Helps for Triangle Counting in Graph Streams | 2020 | PODS | 5.4598872e-05 |
| 4,453 | Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage | 2018 | VLDB | 6.7506837e-05 |
| 6,619 | Triangle and Four Cycle Counting in the Data Stream Model | 2020 | PODS | 5.8801548e-05 |
| 1,178 | Counting and Sampling Triangles from a Graph Stream | 2013 | VLDB | 0.00011907399 |
| 454 | Counting Triangles in Data Streams | 2006 | PODS | 0.00018243292 |