A new (k,δ)-dense subhypergraph model with fair-stable algorithms reduces decomposition complexity and yields smoother, less redundant layers than k-core baselines on real hypergraphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Density Decomposition on Hypergraphs
A new (k,δ)-dense subhypergraph model with fair-stable algorithms reduces decomposition complexity and yields smoother, less redundant layers than k-core baselines on real hypergraphs.