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
基金
欧洲研究理事会;
关键词
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
相关论文
共 22 条