Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable

被引：0

作者：

Golovach, Petr A. ^{[1
]}

Stamoulis, Giannos ^{[2
,3
]}

Thilikos, Dimitrios M. ^{[4
]}

机构：

[1] Univ Bergen, Dept Informat, Bergen, Norway

[2] Natl & Kapodistrian Univ Athens, Dept Math, Athens, Greece

[3] Interuniv Postgrad Programme Algorithms Log & Dis, Athens, Greece

[4] Univ Montpellier, CNRS, AlGCo Project Team, LIRMM, Montpellier, France

来源：

PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA | 2020年

关键词：

Topological minors; irrelevant vertex technique; treewidth; vertex deletion problems; IRRELEVANT VERTICES; COMPLEXITY;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

For a finite collection of graphs F, the F-TM-Deletion problem has as input an n-vertex graph G and an integer k and asks whether there exists a set S subset of V (G) with vertical bar S vertical bar <= k such that G\S does not contain any of the graphs in F as a topological minor. We prove that for every such F, F-TM-Deletion is fixed parameter tractable on planar graphs. In particular, we provide an f(h; k) . n(2) algorithm where h is an upper bound to the vertices of the graphs in F.

引用

页码：931 / 950

页数：20

共 50 条

[1] Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
Golovach, Petr A.
Stamoulis, Giannos
Thilikos, Dimitrios M.
ACM TRANSACTIONS ON ALGORITHMS, 2023, 19 (03)
[2] Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
Golovach, Petr A.
Stamoulis, Giannos
Thilikos, Dimitrios M.
PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 931 - 950
[3] Finding Topological Subgraphs is Fixed-Parameter Tractable
Grohe, Martin
Kawarabayashi, Ken-ichi
Marx, Daniel
Wollan, Paul
STOC 11: PROCEEDINGS OF THE 43RD ACM SYMPOSIUM ON THEORY OF COMPUTING, 2011, : 479 - 488
[4] Universal Planar Graphs for the Topological Minor Relation
Florian Lehner
Combinatorica, 2024, 44 : 209 - 230
[5] Universal Planar Graphs for the Topological Minor Relation
Lehner, Florian
COMBINATORICA, 2024, 44 (01) : 209 - 230
[6] Sparse Covers for Planar Graphs and Graphs that Exclude a Fixed Minor
Costas Busch
Ryan LaFortune
Srikanta Tirthapura
Algorithmica, 2014, 69 : 658 - 684
[7] Sparse Covers for Planar Graphs and Graphs that Exclude a Fixed Minor
Busch, Costas
LaFortune, Ryan
Tirthapura, Srikanta
ALGORITHMICA, 2014, 69 (03) : 658 - 684
[8] Dominating set is fixed parameter tractable in claw-free graphs
Cygan, Marek
Philip, Geevarghese
Pilipczuk, Marcin
Pilipczuk, Michal
Wojtaszczyk, Jakub Onufry
THEORETICAL COMPUTER SCIENCE, 2011, 412 (50) : 6982 - 7000
[9] The dominating set problem is fixed parameter tractable for graphs of bounded genus
Ellis, J
Fan, H
Fellows, M
ALGORITHM THEORY - SWAT 2002, 2002, 2368 : 180 - 189
[10] The dominating set problem is fixed parameter tractable for graphs of bounded genus
Ellis, J
Fan, H
Fellows, M
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2004, 52 (02): : 152 - 168

← 1 2 3 4 5 →