Polynomial Kernel for Interval Vertex Deletion

被引：0

作者：

Agrawal, Akanksha ^{[1
]}

Lokshtanov, Daniel ^{[2
]}

Misra, Pranabendu ^{[3
]}

Saurabh, Saket ^{[4
,5
]}

Zehavi, Meirav ^{[6
]}

机构：

[1] Indian Inst Technol Madras, Chennai, Tamil Nadu, India

[2] Univ Calif Santa Barbara, Santa Barbara, CA 93106 USA

[3] Chennai Math Inst, Chennai, Tamil Nadu, India

[4] Homi Bhabha Natl Inst, Chennai, Tamil Nadu, India

[5] Univ Bergen, Bergen, Norway

[6] Ben Gurion Univ Negev, Beer Sheva, Israel

来源：

ACM TRANSACTIONS ON ALGORITHMS | 2023年 / 19卷 / 02期

基金：

以色列科学基金会; 欧洲研究理事会;

关键词：

Interval Vertex Deletion; kernelization; polynomial kernel; parameterized complexity; INCIDENCE MATRICES; APPROXIMATION;

D O I：

10.1145/3571075

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Given a graph G and an integer k, the Interval Vertex Deletion (IVD) problem asks whether there exists a subset S subset of V (G) of size at most k such that G - S is an interval graph. This problem is known to be NP-complete (according to Yannakakis at STOC 1978). Originally in 2012, Cao and Marx showed that IVD is fixed parameter tractable: they exhibited an algorithm with running time 10(k)n(O)(1). The existence of a polynomial kernel for IVD remained a well-known open problem in parameterized complexity. In this article, we settle this problem in the affirmative.

引用

页数：68

共 50 条

[1] A POLYNOMIAL KERNEL FOR PROPER INTERVAL VERTEX DELETION
Fomin, Fedor V.
Saurabh, Saket
Villanger, Yngve
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (04) : 1964 - 1976
[2] A Polynomial Kernel for PROPER INTERVAL VERTEX DELETION
Fomin, Fedor V.
Saurabh, Saket
Villanger, Yngve
[J]. ALGORITHMS - ESA 2012, 2012, 7501 : 467 - 478
[3] A Polynomial Kernel for Bipartite Permutation Vertex Deletion
Derbisz, Jan
Kanesh, Lawqueen
Madathil, Jayakrishnan
Sahu, Abhishek
Saurabh, Saket
Verma, Shaily
[J]. ALGORITHMICA, 2022, 84 (11) : 3246 - 3275
[4] A Polynomial Kernel for Bipartite Permutation Vertex Deletion
Jan Derbisz
Lawqueen Kanesh
Jayakrishnan Madathil
Abhishek Sahu
Saket Saurabh
Shaily Verma
[J]. Algorithmica, 2022, 84 : 3246 - 3275
[5] A polynomial kernel for distance-hereditary vertex deletion
Kim, Eun Jung
Kwon, O-Joung
[J]. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2017, 10389 LNCS : 509 - 520
[6] A Polynomial Kernel for Distance-Hereditary Vertex Deletion
Eun Jung Kim
O-joung Kwon
[J]. Algorithmica, 2021, 83 : 2096 - 2141
[7] A polynomial kernel for Distance-Hereditary Vertex Deletion
Jung, Eun
Kwon, O-Joung
[J]. ALGORITHMS AND DATA STRUCTURES: 15TH INTERNATIONAL SYMPOSIUM, WADS 2017, 2017, 10389 : 509 - 520
[8] A Polynomial Kernel for Distance-Hereditary Vertex Deletion
Kim, Eun Jung
Kwon, O-joung
[J]. ALGORITHMICA, 2021, 83 (07) : 2096 - 2141
[9] A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion
Agrawal, Akanksha
Jana, Satyabrata
Sahu, Abhishek
[J]. LATIN 2024: THEORETICAL INFORMATICS, PT II, 2024, 14579 : 208 - 222
[10] An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion
Mamadou Moustapha Kanté
Eun Jung Kim
O-joung Kwon
Christophe Paul
[J]. Algorithmica, 2017, 79 : 66 - 95

← 1 2 3 4 5 →