Efficient Computation of Hyper-triangles on Hypergraphs
Summary: Introduce hyperwedge-based formation pathway and classification of hyper-triangle patterns to avoid exhaustive hyperedge-combination checks. Present a two-step framework with pattern-specific exact and approximate counting algorithms and a fine-grained hypergraph clustering coefficient. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Haozhe Yin (University of New South Wales)
- 2. Kai Wang (Shanghai Jiao Tong University)
- 3. Wenjie Zhang (University of New South Wales)
- 4. Ying Zhang (Zhejiang Gongshang University)
- 5. Ruijia Wu (Shanghai Jiao Tong University)
- 6. Xuemin Lin (Shanghai Jiao Tong University)
BibTeX Citation
@article{yin_vldb25,
title = {{Efficient Computation of Hyper-triangles on Hypergraphs}},
author = {Yin, Haozhe and Wang, Kai and Zhang, Wenjie and Zhang, Ying and Wu, Ruijia and Lin, Xuemin},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {3},
pages = {729--742},
doi = {10.14778/3712221.3712238},
url = {https://doi.org/10.14778/3712221.3712238},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,411 | Triangle Counting in Hypergraph Streams: A Complete and Practical Approach | 2026 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 102 | Truss Decomposition in Massive Networks | 2012 | VLDB | 0.00034255289 |
| 1,103 | Counting and Sampling Triangles from a Graph Stream | 2013 | VLDB | 0.000121583 |
| 1,328 | Truss-based Community Search over Large Directed Graphs | 2020 | SIGMOD | 0.00011140898 |
| 1,647 | Effective and Efficient Community Search over Large Heterogeneous Information Networks | 2020 | VLDB | 0.00010125633 |
| 3,686 | Accelerating Triangle Counting on GPU | 2021 | SIGMOD | 7.2029305e-05 |
| 3,911 | Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs | 2024 | VLDB | 7.0240227e-05 |
| 4,613 | On Sampling from Massive Graph Streams | 2017 | VLDB | 6.6071509e-05 |
| 5,598 | Hypergraph Motifs: Concepts, Algorithms, and Discoveries | 2020 | VLDB | 6.1546212e-05 |
| 7,455 | Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks | 2023 | SIGMOD | 5.6127752e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,877 | Efficient and Adaptive Estimation of Local Triadic Coefficients | 2025 | VLDB |
| 2 | 5,598 | Hypergraph Motifs: Concepts, Algorithms, and Discoveries | 2020 | VLDB |
| 3 | 9,375 | Efficiently Counting Triangles in Large Temporal Graphs | 2025 | SIGMOD |
| 4 | 11,412 | Modularity-based Hypergraph Clustering: Random Hypergraph Model, Hyperedge-cluster Relation, and Computation | 2023 | SIGMOD |
| 5 | 5,960 | On Graph Representation for Attributed Hypergraph Clustering | 2025 | SIGMOD |
| 6 | 3,997 | Efficient Bi-triangle Counting for Large Bipartite Networks | 2021 | VLDB |
| 7 | 9,301 | Accelerating Core Decomposition in Billion-Scale Hypergraphs | 2025 | SIGMOD |
| 8 | 8,188 | Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation | 2023 | SIGMOD |
| 9 | 10,857 | Truss Decomposition in Hypergraphs | 2025 | VLDB |
| 10 | 10,411 | Triangle Counting in Hypergraph Streams: A Complete and Practical Approach | 2026 | SIGMOD |