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 (Shenzhen University; Xi'an Jiaotong University)
- 2. Yiyan Qi (Xi'an Jiaotong University)
- 3. Yu Sun (Xi'an Jiaotong University)
- 4. Xiangliang Zhang (King Abdullah University of Science and Technology)
- 5. Jing Tao (Xi'an Jiaotong University)
- 6. Xiaohong Guan (Tsinghua University; Xi'an Jiaotong University)
BibTeX Citation
@article{wang_vldb18,
title = {{Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage}},
author = {Wang, Pinghui and Qi, Yiyan and Sun, Yu and Zhang, Xiangliang and Tao, Jing and Guan, Xiaohong},
journal = {PVLDB},
series = {{VLDB} '18},
doi = {10.14778/3149193.3149197},
url = {https://doi.org/10.14778/3149193.3149197},
year = {2018}
}Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,669 | Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges | 2021 | SIGMOD | 8.1531412e-05 |
| 3,539 | Hypergraph Motifs: Concepts, Algorithms, and Discoveries | 2020 | VLDB | 7.2173698e-05 |
| 7,913 | Triangular Stability Maximization by Influence Spread over Social Networks | 2023 | VLDB | 5.4277727e-05 |
| 8,211 | LM-SRPQ: Efficiently Answering Regular Path Query in Streaming Graphs | 2024 | VLDB | 5.3772821e-05 |
| 10,056 | Finding Logic Bugs in Graph-processing Systems via Graph-cutting | 2025 | SIGMOD | 5.0875952e-05 |
| 11,253 | GREAT: Generalized Reservoir Sampling based Triangle Counting Estimation over Streaming Graphs | 2025 | VLDB | 4.9793485e-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 |
|---|---|---|---|---|
| 462 | Counting Triangles in Data Streams | 2006 | PODS | 0.00017807125 |
| 600 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00015740352 |
| 1,121 | Counting and Sampling Triangles from a Graph Stream | 2013 | VLDB | 0.000119396 |
| 2,215 | The Input/Output Complexity of Triangle Enumeration | 2014 | PODS | 8.8194236e-05 |
| 2,852 | All-Distances Sketches, Revisited: HIP Estimators for Massive Graphs Analysis | 2014 | PODS | 7.9412916e-05 |
| 3,380 | OPT: A New Framework for Overlapped and Parallel Triangulation in Large-scale Graphs | 2014 | SIGMOD | 7.3567664e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,089 | How the Degeneracy Helps for Triangle Counting in Graph Streams | 2020 | PODS |
| 2 | 8,645 | Efficiently Counting Triangles in Large Temporal Graphs | 2025 | SIGMOD |
| 3 | 11,829 | Approximately Counting Subgraphs in Data Streams | 2022 | PODS |
| 4 | 4,575 | On Sampling from Massive Graph Streams | 2017 | VLDB |
| 5 | 10,603 | Triangle Counting in Hypergraph Streams: A Complete and Practical Approach | 2026 | SIGMOD |
| 6 | 11,253 | GREAT: Generalized Reservoir Sampling based Triangle Counting Estimation over Streaming Graphs | 2025 | VLDB |
| 7 | 1,121 | Counting and Sampling Triangles from a Graph Stream | 2013 | VLDB |
| 8 | 5,232 | Better Algorithms for Counting Triangles in Data Streams | 2016 | PODS |
| 9 | 2,669 | Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges | 2021 | SIGMOD |
| 10 | 462 | Counting Triangles in Data Streams | 2006 | PODS |