Counting and Sampling Triangles from a Graph Stream

Summary: Space-efficient streaming algorithm for counting and sampling triangles (and constant-sized cliques) in massive graphs, one-pass with low memory. Outperforms prior work in space and time, with a simple implementation and strong practical performance on large-scale data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 10673
Venue: VLDB
Year: 2013
Pagerank: 0.00012473724
Overall Rank: 1,344 | 90.66%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 19 of 19 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
3,063	Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges	2021	SIGMOD	7.6321424e-05
4,879	Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage	2018	VLDB	5.8575676e-05
4,898	On Sampling from Massive Graph Streams	2017	VLDB	5.8459467e-05
5,046	Better Algorithms for Counting Triangles in Data Streams	2016	PODS	5.7405307e-05
6,395	An In-Depth Study of Continuous Subgraph Matching	2022	VLDB	5.0829204e-05
6,468	The Complexity of Counting Cycles in the Adjacency List Streaming Model	2019	PODS	5.0526408e-05
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
8,533	How the Degeneracy Helps for Triangle Counting in Graph Streams	2020	PODS	4.4937074e-05
8,959	Reservoir Sampling over Joins	2024	SIGMOD	4.4206222e-05
9,632	External Memory Stream Sampling	2015	PODS	4.313481e-05
10,258	TIMEST: Temporal Information Motif Estimator Using Sampling Trees	2026	VLDB	4.1945683e-05
10,276	AGIS: Fast Approximate Graph Pattern Mining with Structure-Informed Sampling	2026	VLDB	4.1945683e-05
10,485	Finding Logic Bugs in Graph-processing Systems via Graph-cutting	2025	SIGMOD	4.1945683e-05
10,582	A Flexible Framework for Query-oriented Interactive Community Search	2025	VLDB	4.1945683e-05
10,586	GREAT: Generalized Reservoir Sampling based Triangle Counting Estimation over Streaming Graphs	2025	VLDB	4.1945683e-05
10,871	Efficient Computation of Hyper-triangles on Hypergraphs	2025	VLDB	4.1945683e-05
11,321	Approximately Counting Subgraphs in Data Streams	2022	PODS	4.1945683e-05
11,559	Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees	2020	SIGMOD	4.1945683e-05

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
392	Counting Triangles in Data Streams	2006	PODS	0.00024556183
1,040	Graph Sketches: Sparsification, Spanners, and Subgraphs	2012	PODS	0.00014488943

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
10,123	Triangle Counting in Hypergraph Streams: A Complete and Practical Approach	2026	SIGMOD	4.1945683e-05
9,228	Efficiently Counting Triangles in Large Temporal Graphs	2025	SIGMOD	4.3690661e-05
4,898	On Sampling from Massive Graph Streams	2017	VLDB	5.8459467e-05
8,533	How the Degeneracy Helps for Triangle Counting in Graph Streams	2020	PODS	4.4937074e-05
3,063	Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges	2021	SIGMOD	7.6321424e-05
6,468	The Complexity of Counting Cycles in the Adjacency List Streaming Model	2019	PODS	5.0526408e-05
589	Massive Graph Triangulation	2013	SIGMOD	0.00019576567
4,879	Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage	2018	VLDB	5.8575676e-05
5,046	Better Algorithms for Counting Triangles in Data Streams	2016	PODS	5.7405307e-05
392	Counting Triangles in Data Streams	2006	PODS	0.00024556183