Faster Parameterized Algorithm for Cluster Vertex Deletion

Research output: Contribution to journalArticlepeer-review


In the Cluster Vertex Deletion problem the input is a graph G and an integer k. The goal is to decide whether there is a set of vertices S of size at most k such that the deletion of the vertices of S from G results in a graph in which every connected component is a clique. We give an algorithm for Cluster Vertex Deletion whose running time is O(1.811k).

Original languageAmerican English
Pages (from-to)323-343
Number of pages21
JournalTheory of Computing Systems
Issue number2
StatePublished - 1 Feb 2021


  • Graph algorithms
  • Parameterized complexity

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computational Theory and Mathematics


Dive into the research topics of 'Faster Parameterized Algorithm for Cluster Vertex Deletion'. Together they form a unique fingerprint.

Cite this