The authors propose the (k,g)-core model and two algorithms, EPA and BCA, for finding and decomposing cohesive subhypergraphs based on pair co-occurrence.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SI 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs
The authors propose the (k,g)-core model and two algorithms, EPA and BCA, for finding and decomposing cohesive subhypergraphs based on pair co-occurrence.