OCSM : Finding Overlapping Cohesive Subgraphs with Minimum Degree

TL;DR

This paper introduces the OCSM problem to find overlapping cohesive subgraphs with minimum degree and density constraints, proposing two algorithms and validating their effectiveness on real-world networks.

Contribution

It is the first work to address overlapping cohesive subgraphs with minimum degree considering graph density, with two novel algorithms for NP-hard problem.

Findings

Algorithms are effective and efficient on real-world networks.

Proposed methods outperform baseline approaches.

Overlapping subgraphs with minimum degree are successfully identified.

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 minimum degree by incorporating the graph density. Since the OCSM problem is NP-hard, we propose two algorithms: advanced peeling algorithm and seed-based expansion algorithm. Finally, we show the experimental study with real-world networks to demonstrate the effectiveness and efficiency of our proposed algorithms.