A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
[chapter]
2012
Lecture Notes in Computer Science
Given an undirected graph G = (V, E) and an integer ≥ 1, the NPhard 2-Club problem asks for a vertex set S ⊆ V of size at least such that the subgraph induced by S has diameter at most two. In this work, we extend previous parameterized complexity studies for 2-Club. On the positive side, we give polynomial-size problem kernels for the parameters feedback edge set size of G and size of a cluster editing set of G and present a direct combinatorial algorithm for the parameter treewidth of G. On
doi:10.1007/978-3-642-33293-7_22
fatcat:5hbgpg6wuzbcbetfwpivstuxle