A Polynomial kernel for Proper Interval Vertex Deletion
Data Structures and Algorithms
2015-03-20 v1
Abstract
It is known that the problem of deleting at most k vertices to obtain a proper interval graph (Proper Interval Vertex Deletion) is fixed parameter tractable. However, whether the problem admits a polynomial kernel or not was open. Here, we answers this question in affirmative by obtaining a polynomial kernel for Proper Interval Vertex Deletion. This resolves an open question of van Bevern, Komusiewicz, Moser, and Niedermeier.
Keywords
Cite
@article{arxiv.1204.4880,
title = {A Polynomial kernel for Proper Interval Vertex Deletion},
author = {Fedor V. Fomin and Saket Saurabh and Yngve Villanger},
journal= {arXiv preprint arXiv:1204.4880},
year = {2015}
}
Comments
13 pages, 1 figure