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 条

[11] Imbalance is fixed parameter tractable
Lokshtanov, Daniel
Misra, Neeldhara
Saurabh, Saket
INFORMATION PROCESSING LETTERS, 2013, 113 (19-21) : 714 - 718
[12] Distortion is Fixed Parameter Tractable
Fellows, Michael
Fomin, Fedor V.
Lokshtanov, Daniel
Losievskaja, Elena
Rosamond, Frances
Saurabh, Saket
ACM TRANSACTIONS ON COMPUTATION THEORY, 2013, 5 (04)
[13] Distortion Is Fixed Parameter Tractable
Fellows, Michael R.
Fomin, Fedor V.
Lokshtanov, Daniel
Losievskaja, Elena
Rosamond, Frances A.
Saurabh, Saket
AUTOMATA, LANGUAGES AND PROGRAMMING, PT I, 2009, 5555 : 463 - +
[14] Imbalance Is Fixed Parameter Tractable
Lokshtanov, Daniel
Misra, Neeldhara
Saurabh, Saket
COMPUTING AND COMBINATORICS, 2010, 6196 : 199 - +
[15] A FIXED-PARAMETER TRACTABLE ALGORITHM FOR ELIMINATION DISTANCE TO BOUNDED DEGREE GRAPHS
Agrawal, Akanksha
Kanesh, Lawqueen
Panolan, Fahad
Ramanujan, M. S.
Saurabh, Saket
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2022, 36 (02) : 911 - 921
[16] Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor
Wollan, Paul
Wood, David R.
JOURNAL OF GRAPH THEORY, 2019, 91 (03) : 259 - 266
[17] FIXED-PARAMETER TRACTABLE CANONIZATION AND ISOMORPHISM TEST FOR GRAPHS OF BOUNDED TREEWIDTH
Lokshtanov, Daniel
Pilipczuk, Marcin
Pilipczuk, Michal
Saurabh, Saket
SIAM JOURNAL ON COMPUTING, 2017, 46 (01) : 161 - 189
[18] Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth
Lokshtanov, Daniel
Pilipczuk, Marcin
Pilipczuk, Michal
Saurabh, Saket
2014 55TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2014), 2014, : 186 - 195
[19] Modification to Planarity is Fixed Parameter Tractable
Fomin, Fedor V.
Golovach, Petr A.
Thilikos, Dimitrios M.
36TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2019), 2019,
[20] INTERVAL COMPLETION IS FIXED PARAMETER TRACTABLE
Villanger, Yngve
Heggernes, Pinar
Paul, Christophe
Telle, Jan Arne
SIAM JOURNAL ON COMPUTING, 2009, 38 (05) : 2007 - 2020

← 1 2 3 4 5 →