2000 character limit reached
On the Parameterized Complexity of the $s$-Club Cluster Edge Deletion Problem (2205.10834v1)
Published 22 May 2022 in cs.DS and cs.CC
Abstract: We study the parameterized complexity of the $s$-Club Cluster Edge Deletion problem: Given a graph $G$ and two integers $s \ge 2$ and $k \ge 1$, is it possible to remove at most $k$ edges from $G$ such that each connected component of the resulting graph has diameter at most $s$? This problem is known to be NP-hard already when $s = 2$. We prove that it admits a fixed-parameter tractable algorithm when parameterized by $s$ and the treewidth of the input graph.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
