Multivariate Algorithmics for Finding Cohesive Subnetworks
AbstractCommunity 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
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Komusiewicz, C. Multivariate Algorithmics for Finding Cohesive Subnetworks. Algorithms 2016, 9, 21.
Komusiewicz C. Multivariate Algorithmics for Finding Cohesive Subnetworks. Algorithms. 2016; 9(1):21.Chicago/Turabian Style
Komusiewicz, Christian. 2016. "Multivariate Algorithmics for Finding Cohesive Subnetworks." Algorithms 9, no. 1: 21.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.