Exact and approximation algorithms for densest k-subgraph

Abstract : The densest k-subgraph problem is a generalization of the maximum clique problem, in which we are given a graph G and a positive integer k, and we search among the subsets of k vertices of G one inducing a maximum number of edges. In this paper, we present algorithms for finding exact solutions of densest k-subgraph improving the standard exponential time complexity of $O^*(2^n)$ and using polynomial space. Two FPT algorithms are also proposed; the first considers as parameter the treewidth of the input graph and uses exponential space, while the second is parameterized by the size of the minimum vertex cover and uses polynomial space. Finally, we propose several approximation algorithms running in moderately exponential or parameterized time.
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00874586
Contributor : Eleni Palaiologou <>
Submitted on : Friday, October 18, 2013 - 11:29:38 AM
Last modification on : Wednesday, February 19, 2020 - 8:55:48 AM
Long-term archiving on: Friday, April 7, 2017 - 1:07:57 PM

File

cahier_324.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00874586, version 1

Citation

Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Paschos. Exact and approximation algorithms for densest k-subgraph. 2012. ⟨hal-00874586⟩

Share

Metrics

Record views

444

Files downloads

1299