2 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
Cohesive Subgraph Discovery in Hypergraphs: A Locality-Driven Indexing Framework
Song Kim, Dahee Kim, Taejoon Han +3
Hypergraphs, increasingly utilised for modelling complex and diverse relationships in modern networks, gain much attention representing intricate higher-order interactions. Among v…