Triangle Counting in Hypergraph Streams: A Complete and Practical Approach
Summary: Complete taxonomy of hyper-vertex triangles (inner, hybrid, outer) enabling unified hypergraph triangle counting in streams. HTCount (memory-adaptive reservoir sampling) and HTCount-P (partitioned reservoirs) provide unbiased estimators with variance bounds and 10–100× lower error under tight memory. (summarized by gpt-5-mini on Feb 11 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Lingkai Meng
- 2. Long Yuan
- 3. Xuemin Lin
- 4. Wenjie Zhang
- 5. Ying Zhang
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 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,637 | Truss-based Community Search over Large Directed Graphs | 2020 | SIGMOD | 0.0001105259 |
| 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 |
| 9,477 | Revisiting Graph Analytics Benchmark | 2025 | SIGMOD | 4.3341665e-05 |
| 10,871 | Efficient Computation of Hyper-triangles on Hypergraphs | 2025 | VLDB | 4.1945683e-05 |
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,596 | Truss Decomposition in Hypergraphs | 2025 | VLDB | 4.1945683e-05 |
| 4,898 | On Sampling from Massive Graph Streams | 2017 | VLDB | 5.8459467e-05 |
| 1,344 | Counting and Sampling Triangles from a Graph Stream | 2013 | VLDB | 0.00012473724 |
| 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 |
| 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 |
| 392 | Counting Triangles in Data Streams | 2006 | PODS | 0.00024556183 |
| 10,871 | Efficient Computation of Hyper-triangles on Hypergraphs | 2025 | VLDB | 4.1945683e-05 |