Database Paper Browser

Back to papers

Truss Decomposition in Hypergraphs

Summary: Introduces hypergraph k-truss (nodes in ≥k hyper‑triangles) and a truss decomposition framework identifying hyper‑triangle counting as the bottleneck. Proposes an edge‑iterator, a hybrid edge+node iterator with pruning, a prefix‑forest encoding for shared nodes, reordering optimizations, and empirical validation on real hypergraphs. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
13870
Venue
VLDB
Year
2025
Pagerank
4.1945683e-05
Overall Rank
10,596 | 26.29%
DOI
10.14778/3734839.3734854

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 16 of 16 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