Cluster deletion revisited

•We study the Cluster Deletion problem and give an O⁎(1.404k)-time algorithm for this problem.•Our result improves the result of Böcker and Damaschke for this problem who gave an O⁎(1.415k)-time algorithm.•The analysis of the algorithm in the paper of Böcker and Damaschke has an error, which we fix...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information processing letters Ročník 173; s. 106171
Hlavní autor: Tsur, Dekel
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.01.2022
Témata:
Branching algorithms
Graph algorithms
Parameterized complexity
Parameterized complexity
Branching algorithms
Graph algorithms
ISSN:0020-0190, 1872-6119
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•We study the Cluster Deletion problem and give an O⁎(1.404k)-time algorithm for this problem.•Our result improves the result of Böcker and Damaschke for this problem who gave an O⁎(1.415k)-time algorithm.•The analysis of the algorithm in the paper of Böcker and Damaschke has an error, which we fix in this paper. 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.404k).
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2021.106171