Approximate Triangle Count and Clustering Coefficient
Summary: Approximate triangle count and clustering coefficient for graphs. Presents scalable estimation methods to compute these metrics efficiently on large graphs, bridging graph analytics and data-management concerns. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,228 | Efficiently Counting Triangles in Large Temporal Graphs | 2025 | SIGMOD | 4.3690661e-05 |
| 10,586 | GREAT: Generalized Reservoir Sampling based Triangle Counting Estimation over Streaming Graphs | 2025 | VLDB | 4.1945683e-05 |
| 5,046 | Better Algorithms for Counting Triangles in Data Streams | 2016 | PODS | 5.7405307e-05 |
| 7,451 | Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks | 2023 | SIGMOD | 4.7263711e-05 |
| 10,871 | Efficient Computation of Hyper-triangles on Hypergraphs | 2025 | VLDB | 4.1945683e-05 |
| 4,459 | Efficient Bi-triangle Counting for Large Bipartite Networks | 2021 | VLDB | 6.1651553e-05 |
| 3,063 | Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges | 2021 | SIGMOD | 7.6321424e-05 |
| 10,623 | Efficient and Adaptive Estimation of Local Triadic Coefficients | 2025 | VLDB | 4.1945683e-05 |
| 1,344 | Counting and Sampling Triangles from a Graph Stream | 2013 | VLDB | 0.00012473724 |
| 392 | Counting Triangles in Data Streams | 2006 | PODS | 0.00024556183 |