Multivariate Algorithmics for Finding Cohesive Subnetworks

Abstract

Community detection is an important task in the analysis of biological, social or technical networks. We survey different models of cohesive graphs, commonly referred to as clique relaxations, that are used in the detection of network communities. For each clique relaxation, we give an overview of basic model properties and of the complexity of the problem of finding large cohesive subgraphs under this model. Since this problem is usually NP-hard, we focus on combinatorial fixed-parameter algorithms exploiting typical structural properties of input networks.

Keywords

• clique relaxations
• dense subgraphs
• NP-hard problem
• network communities
• fixed-parameter algorithms