We study the parameterized complexity of the s-Club Cluster Edge Deletion problem: Given a graph G and two integers s ≥ 2 and k ≥ 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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.