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 条
  • [1] A Polynomial Kernel for PROPER INTERVAL VERTEX DELETION
    Fomin, Fedor V.
    Saurabh, Saket
    Villanger, Yngve
    ALGORITHMS - ESA 2012, 2012, 7501 : 467 - 478
  • [2] Polynomial Kernel for Interval Vertex Deletion
    Agrawal, Akanksha
    Lokshtanov, Daniel
    Misra, Pranabendu
    Saurabh, Saket
    Zehavi, Meirav
    ACM TRANSACTIONS ON ALGORITHMS, 2023, 19 (02)
  • [3] A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion
    Agrawal, Akanksha
    Jana, Satyabrata
    Sahu, Abhishek
    LATIN 2024: THEORETICAL INFORMATICS, PT II, 2024, 14579 : 208 - 222
  • [4] Proper Interval Vertex Deletion
    Pim van ’t Hof
    Yngve Villanger
    Algorithmica, 2013, 65 : 845 - 867
  • [5] Proper Interval Vertex Deletion
    Villanger, Yngve
    PARAMETERIZED AND EXACT COMPUTATION, 2010, 6478 : 228 - 238
  • [6] Proper Interval Vertex Deletion
    van 't Hof, Pim
    Villanger, Yngve
    ALGORITHMICA, 2013, 65 (04) : 845 - 867
  • [7] A Polynomial Kernel for Bipartite Permutation Vertex Deletion
    Derbisz, Jan
    Kanesh, Lawqueen
    Madathil, Jayakrishnan
    Sahu, Abhishek
    Saurabh, Saket
    Verma, Shaily
    ALGORITHMICA, 2022, 84 (11) : 3246 - 3275
  • [8] A Polynomial Kernel for Bipartite Permutation Vertex Deletion
    Jan Derbisz
    Lawqueen Kanesh
    Jayakrishnan Madathil
    Abhishek Sahu
    Saket Saurabh
    Shaily Verma
    Algorithmica, 2022, 84 : 3246 - 3275
  • [9] A polynomial kernel for distance-hereditary vertex deletion
    Kim, Eun Jung
    Kwon, O-Joung
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2017, 10389 LNCS : 509 - 520
  • [10] A Polynomial Kernel for Distance-Hereditary Vertex Deletion
    Eun Jung Kim
    O-joung Kwon
    Algorithmica, 2021, 83 : 2096 - 2141
12345