A More Complicated Hardness Proof for Finding Densest Subgraphs in Bounded Degree Graphs
Computational Complexity
2013-06-28 v1 Discrete Mathematics
Combinatorics
Abstract
We consider the Densest-Subgraph problem, where a graph and an integer k is given and we search for a subgraph on exactly k vertices that induces the maximum number of edges. We prove that this problem is NP-hard even when the input graph has maximum degree three.
Cite
@article{arxiv.1306.6598,
title = {A More Complicated Hardness Proof for Finding Densest Subgraphs in Bounded Degree Graphs},
author = {Manuel Sorge},
journal= {arXiv preprint arXiv:1306.6598},
year = {2013}
}