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 条

[41] Approximation and Tidying—A Problem Kernel for s-Plex Cluster Vertex Deletion
René van Bevern
Hannes Moser
Rolf Niedermeier
[J]. Algorithmica, 2012, 62 : 930 - 950
[42] A DETERMINISTIC POLYNOMIAL KERNEL FOR ODD CYCLE TRANSVERSAL AND VERTEX MULTIWAY CUT IN PLANAR GRAPHS
Jansen, Bart M. P.
Pilipczuk, Marcin L.
Van Leeuwen, Erik Jan
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2021, 35 (04) : 2387 - 2429
[43] A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs
Jansen, Bart M. P.
Pilipczuk, Marcin
van Leeuwen, Erik Jan
[J]. 36TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2019), 2019,
[44] Approximation and Tidying-A Problem Kernel for s-Plex Cluster Vertex Deletion
van Bevern, Rene
Moser, Hannes
Niedermeier, Rolf
[J]. ALGORITHMICA, 2012, 62 (3-4) : 930 - 950
[45] Polynomial time algorithm for k-vertex-edge dominating problem in interval graphs
Li, Peng
Wang, Aifa
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2023, 45 (01)
[46] Polynomial time algorithm for k-vertex-edge dominating problem in interval graphs
Peng Li
Aifa Wang
[J]. Journal of Combinatorial Optimization, 2023, 45
[47] Interval vertex coloring
Macekova, Maria
Sarosiova, Zuzana
Sotak, Roman
[J]. APPLIED MATHEMATICS AND COMPUTATION, 2024, 470
[48] s-Club Cluster Vertex Deletion on interval and well-partitioned chordal graphs
Chakraborty, Dibyayan
Chandran, L. Sunil
Padinhatteeri, Sajith
Pillai, Raji R.
[J]. DISCRETE APPLIED MATHEMATICS, 2024, 345 : 170 - 189
[49] s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs
Chakraborty, Dibyayan
Chandran, L. Sunil
Padinhatteeri, Sajith
Pillai, Raji R.
[J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2022), 2022, 13453 : 129 - 143
[50] VERTEX CUT POLYNOMIAL OF GRAPHS
Safeera, K.
Kumar, V. Anil
[J]. ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2022, 32 : 1 - 12

← 1 2 3 4 5 →