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: 10861
Venue: VLDB
Year: 2013
Pagerank: 0.000121583
Overall Rank: 1,103 | 92.44%
DOI: 10.14778/2556549.2556571

Incoming Non-self Citations Over Time

Authors

1. A. Pavan (Iowa State University)
2. Kanat Tangwongsan (IBM)
3. Srikanta Tirthapura (Iowa State University)
4. Kun-Lung Wu (IBM)

BibTeX Citation

@article{pavan_vldb13,
        title = {{Counting and Sampling Triangles from a Graph Stream}},
        author = {Pavan, A. and Tangwongsan, Kanat and Tirthapura, Srikanta and Wu, Kun-Lung},
        journal = {PVLDB},
        series = {{VLDB} '13},
        volume = {6},
        number = {14},
        pages = {1870--1881},
        doi = {10.14778/2556549.2556571},
        url = {https://doi.org/10.14778/2556549.2556571},
        year = {2013}
}

Incoming Citations (Sorted by Pagerank)

Showing 20 of 20 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
2,635	Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges	2021	SIGMOD	8.3200595e-05
4,500	Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage	2018	VLDB	6.6603827e-05
4,613	On Sampling from Massive Graph Streams	2017	VLDB	6.6071509e-05
5,110	Better Algorithms for Counting Triangles in Data Streams	2016	PODS	6.3609746e-05
5,506	Accurate and Fast Approximate Graph Pattern Mining at Scale	2025	VLDB	6.1925892e-05
5,870	An In-Depth Study of Continuous Subgraph Matching	2022	VLDB	6.061038e-05
6,363	The Complexity of Counting Cycles in the Adjacency List Streaming Model	2019	PODS	5.9000002e-05
6,873	Triangle and Four Cycle Counting in the Data Stream Model	2020	PODS	5.7495468e-05
7,335	Reservoir Sampling over Joins	2024	SIGMOD	5.64193e-05
8,928	How the Degeneracy Helps for Triangle Counting in Graph Streams	2020	PODS	5.3483178e-05
9,691	A Flexible Framework for Query-oriented Interactive Community Search	2025	VLDB	5.2351259e-05
9,732	External Memory Stream Sampling	2015	PODS	5.2279411e-05
9,866	Finding Logic Bugs in Graph-processing Systems via Graph-cutting	2025	SIGMOD	5.2043672e-05
10,192	An Efficient Streaming Algorithm for Approximating Graphlet Distributions	2026	SIGMOD	5.093636e-05
10,546	TIMEST: Temporal Information Motif Estimator Using Sampling Trees	2026	VLDB	5.093636e-05
10,575	AGIS: Fast Approximate Graph Pattern Mining with Structure-Informed Sampling	2026	VLDB	5.093636e-05
10,847	GREAT: Generalized Reservoir Sampling based Triangle Counting Estimation over Streaming Graphs	2025	VLDB	5.093636e-05
11,094	Efficient Computation of Hyper-triangles on Hypergraphs	2025	VLDB	5.093636e-05
11,520	Approximately Counting Subgraphs in Data Streams	2022	PODS	5.093636e-05
11,756	Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees	2020	SIGMOD	5.093636e-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
458	Counting Triangles in Data Streams	2006	PODS	0.0001810876
1,146	Graph Sketches: Sparsification, Spanners, and Subgraphs	2012	PODS	0.00011984702

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	10,411	Triangle Counting in Hypergraph Streams: A Complete and Practical Approach	2026	SIGMOD
2	9,375	Efficiently Counting Triangles in Large Temporal Graphs	2025	SIGMOD
3	4,613	On Sampling from Massive Graph Streams	2017	VLDB
4	8,928	How the Degeneracy Helps for Triangle Counting in Graph Streams	2020	PODS
5	2,635	Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges	2021	SIGMOD
6	6,363	The Complexity of Counting Cycles in the Adjacency List Streaming Model	2019	PODS
7	594	Massive Graph Triangulation	2013	SIGMOD
8	4,500	Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage	2018	VLDB
9	5,110	Better Algorithms for Counting Triangles in Data Streams	2016	PODS
10	458	Counting Triangles in Data Streams	2006	PODS