Back to papers
Counting Triangles in Data Streams
Summary: Two space-bounded random-sampling streaming algorithms for triangle counting: an order-agnostic method with space tied to triangles/(triples with ≥1 edge), and an incidence-stream method with space tied to triangles/length-2 paths and update time O(log|V|*(1+s|V|/|E|)). Scales with graph structure not |V|; implemented on graphs up to 1B edges and the incidence algorithm achieves ≲6% average error with s=10k.
(summarized by gpt-5-mini on Feb 09 2026)
- Paper ID
- 1397
- Venue
- PODS
- Year
- 2006
- Pagerank
- 0.00024649634
- Overall Rank
- 389 | 97.30%
- DOI
-
-
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 24 of 24 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 589 |
Estimating PageRank on Graph Streams |
2008 |
PODS |
0.00019569121 |
| 922 |
Graph Sketches: Sparsification, Spanners, and Subgraphs |
2012 |
PODS |
0.00015254436 |
| 1,348 |
Counting and Sampling Triangles from a Graph Stream |
2013 |
VLDB |
0.00012461666 |
| 1,487 |
Parallel Subgraph Listing in a Large-Scale Graph |
2014 |
SIGMOD |
0.00011691164 |
| 2,439 |
gSketch: On Query Estimation in Graph Streams |
2012 |
VLDB |
8.8181328e-05 |
| 2,799 |
DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine |
2016 |
SIGMOD |
8.109137e-05 |
| 2,807 |
Optimal Sampling from Sliding Windows |
2009 |
PODS |
8.096649e-05 |
| 2,963 |
Subgraph Matching: on Compression and Computation |
2018 |
VLDB |
7.8061004e-05 |
| 3,067 |
Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges |
2021 |
SIGMOD |
7.6247945e-05 |
| 3,226 |
Structural Trend Analysis for Online Social Networks |
2011 |
VLDB |
7.3460638e-05 |
| 3,537 |
OPT: A New Framework for Overlapped and Parallel Triangulation in Large-scale Graphs |
2014 |
SIGMOD |
6.9929946e-05 |
| 4,883 |
Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage |
2018 |
VLDB |
5.8519327e-05 |
| 4,903 |
On Sampling from Massive Graph Streams |
2017 |
VLDB |
5.8403259e-05 |
| 5,043 |
Better Algorithms for Counting Triangles in Data Streams |
2016 |
PODS |
5.7350154e-05 |
| 6,463 |
The Complexity of Counting Cycles in the Adjacency List Streaming Model |
2019 |
PODS |
5.0477915e-05 |
| 6,864 |
Triangle and Four Cycle Counting in the Data Stream Model |
2020 |
PODS |
4.9003179e-05 |
| 7,317 |
Accurate and Fast Approximate Graph Pattern Mining at Scale |
2025 |
VLDB |
4.7593708e-05 |
| 8,532 |
How the Degeneracy Helps for Triangle Counting in Graph Streams |
2020 |
PODS |
4.4893996e-05 |
| 9,231 |
Efficiently Counting Triangles in Large Temporal Graphs |
2025 |
SIGMOD |
4.3648789e-05 |
| 9,479 |
Revisiting Graph Analytics Benchmark |
2025 |
SIGMOD |
4.3300131e-05 |
| 10,354 |
An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs Using Fast Matrix Multiplication |
2025 |
PODS |
4.1905499e-05 |
| 10,594 |
GREAT: Generalized Reservoir Sampling based Triangle Counting Estimation over Streaming Graphs |
2025 |
VLDB |
4.1905499e-05 |
| 10,717 |
Approximate 2-hop neighborhoods on incremental graphs: An efficient lazy approach |
2025 |
VLDB |
4.1905499e-05 |
| 11,323 |
Approximately Counting Subgraphs in Data Streams |
2022 |
PODS |
4.1905499e-05 |
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.
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 8,532 |
How the Degeneracy Helps for Triangle Counting in Graph Streams |
2020 |
PODS |
4.4893996e-05 |
| 10,594 |
GREAT: Generalized Reservoir Sampling based Triangle Counting Estimation over Streaming Graphs |
2025 |
VLDB |
4.1905499e-05 |
| 4,903 |
On Sampling from Massive Graph Streams |
2017 |
VLDB |
5.8403259e-05 |
| 9,231 |
Efficiently Counting Triangles in Large Temporal Graphs |
2025 |
SIGMOD |
4.3648789e-05 |
| 10,123 |
Triangle Counting in Hypergraph Streams: A Complete and Practical Approach |
2026 |
SIGMOD |
4.1905499e-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 |
| 1,348 |
Counting and Sampling Triangles from a Graph Stream |
2013 |
VLDB |
0.00012461666 |
| 4,883 |
Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage |
2018 |
VLDB |
5.8519327e-05 |
| 5,043 |
Better Algorithms for Counting Triangles in Data Streams |
2016 |
PODS |
5.7350154e-05 |