Faster parameterized algorithm for Cluster Vertex Deletion
Data Structures and Algorithms
2019-01-24 v1
Abstract
In the Cluster Vertex Deletion problem the input is a graph and an integer . The goal is to decide whether there is a set of vertices of size at most such that the deletion of the vertices of from results a graph in which every connected component is a clique. We give an algorithm for Cluster Vertex Deletion whose running time is .
Cite
@article{arxiv.1901.07609,
title = {Faster parameterized algorithm for Cluster Vertex Deletion},
author = {Dekel Tsur},
journal= {arXiv preprint arXiv:1901.07609},
year = {2019}
}