Interval Deletion is Fixed-Parameter Tractable
Data Structures and Algorithms
2014-05-07 v3 Discrete Mathematics
Abstract
We study the minimum \emph{interval deletion} problem, which asks for the removal of a set of at most vertices to make a graph of vertices into an interval graph. We present a parameterized algorithm of runtime for this problem, that is, we show the problem is fixed-parameter tractable.
Cite
@article{arxiv.1211.5933,
title = {Interval Deletion is Fixed-Parameter Tractable},
author = {Yixin Cao and Dániel Marx},
journal= {arXiv preprint arXiv:1211.5933},
year = {2014}
}
Comments
Final version, to appear in ACM Transactions on Algorithms