3 papers
cs.SI2026
Efficient Computation of Maximum Flexi-Clique in Networks
Song Kim, Hyewon Kim, Kaiqiang Yu +4
Discovering large cohesive subgraphs is a key task for graph mining. Existing models, such as clique, k-plex, and γ-quasi-clique, use fixed density thresholds that overlook the na…
cs.SI2025
Beyond Trivial Edges: A Fractional Approach to Cohesive Subgraph Detection in Hypergraphs
Hyewon Kim, Woocheol Shin, Dahee Kim +3
Hypergraphs serve as a powerful tool for modeling complex relationships across domains like social networks, transactions, and recommendation systems. The (k,g)-core model effectiv…
cs.SI2025
Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs
Dahee Kim, Hyewon Kim, Song Kim +4
Hypergraphs, increasingly utilised to model complex and diverse relationships in modern networks, have gained significant attention for representing intricate higher-order interact…