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
    34 Citations

    Figures and Topics from this paper

    Explore Further: Topics Discussed in This Paper

    Further Kernelization of Proper Interval Vertex Deletion: New Observations and Refined Analysis
    • 3
    • Highly Influenced
    • PDF
    Unit Interval Vertex Deletion: Fewer Vertices are Relevant
    • 6
    • PDF
    Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms
    • 25
    FPT Algorithm and Polynomial Kernel for Linear Rank-width One Vertex Deletion
    • 2
    • Highly Influenced
    • PDF
    Representative Sets and Irrelevant Vertices: New Tools for Kernelization
    • 130
    • PDF
    Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion
    • 21
    • PDF
    Polynomial kernels for deletion to classes of acyclic digraphs
    • 10
    • PDF
    Approximation and Kernelization for Chordal Vertex Deletion
    • 29
    • Highly Influenced
    • PDF
    An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion
    • 7
    • Highly Influenced
    • PDF

    References

    SHOWING 1-10 OF 50 REFERENCES
    Proper Interval Vertex Deletion
    • 29
    Proper Interval Vertex Deletion
    • 20
    • PDF
    Chordal Deletion is Fixed-Parameter Tractable
    • D. Marx
    • Mathematics, Computer Science
    • Algorithmica
    • 2008
    • 115
    • Highly Influential
    • PDF
    Measuring Indifference: Unit Interval Vertex Deletion
    • 31
    • Highly Influential
    • PDF
    Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties
    • L. Cai
    • Mathematics, Computer Science
    • Inf. Process. Lett.
    • 1996
    • 358
    • Highly Influential
    • PDF
    Single Exponential FPT Algorithm for Interval Vertex Deletion and Interval Completion Problem
    • A. Rafiey
    • Computer Science, Mathematics
    • ArXiv
    • 2012
    • 6
    • PDF
    Interval Deletion Is Fixed-Parameter Tractable
    • 62
    • Highly Influential
    • PDF
    Wheel-Free Deletion Is W[2]-Hard
    • 33
    • Highly Influential
    • PDF
    The Node-Deletion Problem for Hereditary Properties is NP-Complete
    • 454
    • PDF
    Polynomial Kernelizations for MIN F+Π1 and MAX NP
    • S. Kratsch
    • Mathematics, Computer Science
    • Algorithmica
    • 2011
    • 30
    • PDF