Emergent Mind
Faster parameterized algorithm for Cluster Vertex Deletion
(1901.07609)
Published Jan 22, 2019
in
cs.DS
Abstract
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 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)$.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.