Cluster deletion revisited

Research output: Contribution to journalArticlepeer-review


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).

Original languageEnglish
Article number106171
JournalInformation Processing Letters
StatePublished - 1 Jan 2022


  • Branching algorithms
  • Graph algorithms
  • Parameterized complexity


Dive into the research topics of 'Cluster deletion revisited'. Together they form a unique fingerprint.

Cite this