• DOI:10.1137/12089051X
Corpus ID: 17436689

A Polynomial Kernel for Proper Interval Vertex Deletion

@article{Fomin2013APK,
  title={A Polynomial Kernel for Proper Interval Vertex Deletion},
  author={F. Fomin and S. Saurabh and Yngve Villanger},
  journal={SIAM J. Discret. Math.},
  year={2013},
  volume={27},
  pages={1964-1976}
}

F. Fomin, S. Saurabh, Yngve Villanger

Published 2013

Mathematics, Computer Science

SIAM J. Discret. Math.

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 answer this question in the affirmative by obtaining a polynomial kernel for Proper Interval Vertex Deletion. This resolves an open question of van Bevern et al. [Graph-Theoretic Concepts in Computer Science (WG 2010), Lecture Notes in Comput. Sci. 6410… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed