Cluster deletion revisited
Data Structures and Algorithms
2019-07-22 v1
Abstract
In the Cluster Deletion problem the input is a graph and an integer , and the goal is to decide whether there is a set of at most edges whose removal from results a graph in which every connected component is a clique. In this paper we give an algorithm for Cluster Deletion whose running time is .
Cite
@article{arxiv.1907.08399,
title = {Cluster deletion revisited},
author = {Dekel Tsur},
journal= {arXiv preprint arXiv:1907.08399},
year = {2019}
}