OCSM : Finding overlapping cohesive subgraphs with minimum degree

Abstract

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 Subgraphs with Minimum degree (OCSM) problem which combines three key concepts for OCSM: (i) edge-based overlapping, (ii) the minimum degree constraint, and (iii) the graph density. To the best of our knowledge, this is the first work to identify overlapping cohesive subgraphs with the minimum degree by incorporating the graph density. Since the OCSM problem is NP-hard, we propose two algorithms: an advanced peeling algorithm and a seed-based expansion algorithm. Finally, we show the experimental study with real-world networks to demonstrate the effectiveness and efficiency of our proposed algorithms.