OCSM: Finding overlapping cohesive subgraphs with minimum degree

J Kim, S Lim, J Kim - Information Sciences, 2022 - Elsevier
Cohesive subgraph discovery in a network is one of the fundamental problems and
investigated for several decades. In this paper, we propose the Overlapping Cohesive …

Flexi-clique: Exploring Flexible and Sub-linear Clique Structures

S Kim, J Kim, S Yoon, J Kim - Proceedings of the 33rd ACM International …, 2024 - dl.acm.org
Identifying cohesive subgraphs within networks is a fundamental problem in graph theory,
relevant to various domains. The traditional clique problem, which finds fully connected …