Next Article in Journal
Modifying Orthogonal Drawings for Label Placement
Next Article in Special Issue
Uniform vs. Nonuniform Membership for Mildly Context-Sensitive Languages: A Brief Survey
Previous Article in Journal
The Iterative Solution to Discrete-Time H Control Problems for Periodic Systems
Open AccessArticle

Multivariate Algorithmics for Finding Cohesive Subnetworks

Institut für Informatik, Friedrich-Schiller-Universität Jena, Ernst-Abbe-Platz 2, D-07743 Jena, Germany
Academic Editor: Henning Fernau
Algorithms 2016, 9(1), 21; https://doi.org/10.3390/a9010021
Received: 18 January 2016 / Revised: 8 March 2016 / Accepted: 9 March 2016 / Published: 16 March 2016
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. View Full-Text
Keywords: clique relaxations; dense subgraphs; NP-hard problem; network communities; fixed-parameter algorithms clique relaxations; dense subgraphs; NP-hard problem; network communities; fixed-parameter algorithms
Show Figures

Figure 1

MDPI and ACS Style

Komusiewicz, C. Multivariate Algorithmics for Finding Cohesive Subnetworks. Algorithms 2016, 9, 21.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map

1
Back to TopTop