Database Paper Browser

Back to papers

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)

Paper ID
14232
Venue
VLDB
Year
2025
Pagerank
4.1945683e-05
Overall Rank
10,871 | 24.38%
DOI
10.14778/3712221.3712238

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 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
10,123 Triangle Counting in Hypergraph Streams: A Complete and Practical Approach 2026 SIGMOD 4.1945683e-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.

Previous Page 1 / 1 Next

Semantically Similar Papers