Journal
INFORMATION PROCESSING LETTERS
Volume 173, Issue -, Pages -Publisher
ELSEVIER
DOI: 10.1016/j.ipl.2021.106171
Keywords
Graph algorithms; Parameterized complexity; Branching algorithms
Categories
Ask authors/readers for more resources
The paper presents an algorithm for solving the CLUSTER DELETION problem with a running time of O*(1.404(k)).
In the CLUSTER DELETION problem the input is a graph G and an integer k, and the goal is to decide whether there is a set of at most k edges whose removal from G results in a graph in which every connected component is a clique. In this paper we give an algorithm for CLUSTER DELETION whose running time is O*(1.404(k)). (C) 2021 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
