A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs
[chapter]
2014
Lecture Notes in Computer Science
In this paper we study the Sparsest k-Subgraph problem which consists in finding a subset of k vertices in a graph which induces the minimum number of edges. The Sparsest k-Subgraph problem is a natural generalization of the Independent Set problem, and thus is N P-hard (and even W [1]-hard) in general graphs. In this paper we investigate the parameterized complexity of both Sparsest k-Subgraph and Densest k-Subgraph in chordal graphs. We first provide simple proofs that Densest k-Subgraph in
doi:10.1007/978-3-319-04298-5_14
fatcat:l7z47o7txjfdte4nq3tvjeejvu