A POLYNOMIAL KERNEL FOR PROPER INTERVAL VERTEX DELETION

被引：30
|
作者：
Fomin, Fedor V. [1 ]
Saurabh, Saket [2 ,3 ]
Villanger, Yngve [1 ]
机构：
[1] Univ Bergen, Dept Informat, N-5008 Bergen, Norway
[2] Inst Math Sci, Madras 600113, Tamil Nadu, India
[3] Univ Bergen, N-5008 Bergen, Norway
来源：
SIAM JOURNAL ON DISCRETE MATHEMATICS | 2013年 / 27卷 / 04期
基金：
欧洲研究理事会;
关键词：
kernelization; parameterized complexity; proper interval graph; vertex deletion; sunflower lemma;
D O I：
10.1137/12089051X
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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, Springer, Berlin, 2010, pp. 232-243].
引用
收藏
页码：1964 / 1976
页数：13
相关论文
共 50 条
  • [41] Preprocessing for outerplanar vertex deletion: An elementary kernel of quartic size
    Donkers, Huib
    Jansen, Bart M.P.
    Wlodarczyk, Michal
    Leibniz International Proceedings in Informatics, LIPIcs, 2021, 214
  • [42] Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth
    Wlodarczyk, Michal
    ALGORITHMICA, 2025,
  • [43] Computing Role Assignments of Proper Interval Graphs in Polynomial Time
    Heggernes, Pinar
    van't Hof, Pim
    Paulusma, Daniel
    COMBINATORIAL ALGORITHMS, 2011, 6460 : 167 - +
  • [44] Computing role assignments of proper interval graphs in polynomial time
    Heggernes, Pinar
    Van't Hof, Pim
    Paulusma, Daniel
    JOURNAL OF DISCRETE ALGORITHMS, 2012, 14 : 173 - 188
  • [45] An improved branching algorithm for the proper interval edge deletion problem
    Wenjun LI
    Xiaojing TANG
    Yongjie YANG
    Frontiers of Computer Science, 2022, 16 (02) : 173 - 175
  • [46] An improved branching algorithm for the proper interval edge deletion problem
    Wenjun Li
    Xiaojing Tang
    Yongjie Yang
    Frontiers of Computer Science, 2022, 16
  • [47] An improved branching algorithm for the proper interval edge deletion problem
    Li, Wenjun
    Tang, Xiaojing
    Yang, Yongjie
    FRONTIERS OF COMPUTER SCIENCE, 2022, 16 (02)
  • [48] An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion
    Marek Cygan
    Marcin Pilipczuk
    Michał Pilipczuk
    Jakub Onufry Wojtaszczyk
    Algorithmica, 2012, 64 : 170 - 188
  • [49] An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion
    Cygan, Marek
    Pilipczuk, Marcin
    Pilipczuk, Michal
    Wojtaszczyk, Jakub Onufry
    ALGORITHMICA, 2012, 64 (01) : 170 - 188
  • [50] An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion
    Cygan, Marek
    Pilipczuk, Marcin
    Pilipczuk, Michal
    Wojtaszczyk, Jakub Onufry
    PARAMETERIZED AND EXACT COMPUTATION, 2010, 6478 : 95 - 106
12345