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 条

[11] A polynomial kernel for Distance-Hereditary Vertex Deletion
Jung, Eun
Kwon, O-Joung
ALGORITHMS AND DATA STRUCTURES: 15TH INTERNATIONAL SYMPOSIUM, WADS 2017, 2017, 10389 : 509 - 520
[12] A Polynomial Kernel for Distance-Hereditary Vertex Deletion
Kim, Eun Jung
Kwon, O-joung
ALGORITHMICA, 2021, 83 (07) : 2096 - 2141
[13] An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion
Kante, Mamadou Moustapha
Kim, Eun Jung
Kwon, O-joung
Paul, Christophe
ALGORITHMICA, 2017, 79 (01) : 66 - 95
[14] An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion
Mamadou Moustapha Kanté
Eun Jung Kim
O-joung Kwon
Christophe Paul
Algorithmica, 2017, 79 : 66 - 95
[15] Quadratic vertex kernel for split vertex deletion
Agrawal, Akanksha
Gupta, Sushmita
Jain, Pallavi
Krithika, R.
THEORETICAL COMPUTER SCIENCE, 2020, 833 : 164 - 172
[16] Proper interval vertex colorings of graphs
Madaras, Tomas
Matisova, Daniela
Onderko, Alfred
Sarosiova, Zuzana
APPLIED MATHEMATICS AND COMPUTATION, 2024, 477
[17] The graph polynomial and the number of proper vertex colorings
Tarsi, M
ANNALES DE L INSTITUT FOURIER, 1999, 49 (03) : 1089 - +
[18] Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion
Agrawal, Akanksha
Lokshtanov, Daniel
Misra, Pranabendu
Saurabh, Saket
Zehavi, Meirav
PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 1383 - 1398
[19] Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion
Agrawal, Akanksha
Lokshtanov, Daniel
Misra, Pranabendu
Saurabh, Saket
Zehavi, Meirav
ACM TRANSACTIONS ON ALGORITHMS, 2019, 15 (01)
[20] A Polynomial Kernel for Block Graph Deletion
Kim, Eun Jung
Kwon, O-Joung
ALGORITHMICA, 2017, 79 (01) : 251 - 270

← 1 2 3 4 5 →