Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage
Summary: One-pass streaming algorithm uniformly samples distinct edges from large graph streams with duplicates, achieving O(1) per-edge sampling and no extra memory. It infers triangle counts from samples, outperforming prior methods in accuracy and speed within the same memory footprint. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Pinghui Wang
- 2. Yiyan Qi
- 3. Yu Sun
- 4. Xiangliang Zhang
- 5. Jing Tao
- 6. Xiaohong Guan
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 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 |
| 5,518 | Hypergraph Motifs: Concepts, Algorithms, and Discoveries | 2020 | VLDB | 5.4621935e-05 |
| 7,798 | Triangular Stability Maximization by Influence Spread over Social Networks | 2023 | VLDB | 4.6482149e-05 |
| 8,170 | LM-SRPQ: Efficiently Answering Regular Path Query in Streaming Graphs | 2024 | VLDB | 4.5697385e-05 |
| 10,485 | Finding Logic Bugs in Graph-processing Systems via Graph-cutting | 2025 | SIGMOD | 4.1945683e-05 |
| 10,586 | GREAT: Generalized Reservoir Sampling based Triangle Counting Estimation over Streaming Graphs | 2025 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 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 |
| 589 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00019576567 |
| 1,344 | Counting and Sampling Triangles from a Graph Stream | 2013 | VLDB | 0.00012473724 |
| 2,215 | The Input/Output Complexity of Triangle Enumeration | 2014 | PODS | 9.2717602e-05 |
| 2,805 | All-Distances Sketches, Revisited: HIP Estimators for Massive Graphs Analysis | 2014 | PODS | 8.0918347e-05 |
| 3,534 | OPT: A New Framework for Overlapped and Parallel Triangulation in Large-scale Graphs | 2014 | SIGMOD | 6.9997025e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,533 | How the Degeneracy Helps for Triangle Counting in Graph Streams | 2020 | PODS | 4.4937074e-05 |
| 11,321 | Approximately Counting Subgraphs in Data Streams | 2022 | PODS | 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 |
| 10,123 | Triangle Counting in Hypergraph Streams: A Complete and Practical Approach | 2026 | SIGMOD | 4.1945683e-05 |
| 10,586 | GREAT: Generalized Reservoir Sampling based Triangle Counting Estimation over Streaming Graphs | 2025 | VLDB | 4.1945683e-05 |
| 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 |
| 3,063 | Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges | 2021 | SIGMOD | 7.6321424e-05 |
| 392 | Counting Triangles in Data Streams | 2006 | PODS | 0.00024556183 |