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 条

[21] Minimum Bisection is Fixed Parameter Tractable
Cygan, Marek
Lokshtanov, Daniel
Pilipczuk, Marcin
Pilipczuk, Michal
Saurabh, Saket
STOC'14: PROCEEDINGS OF THE 46TH ANNUAL 2014 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2014, : 323 - 332
[22] Fixed-Parameter Tractability of Token Jumping on Planar Graphs
Ito, Takehiro
Kaminski, Marcin
Ono, Hirotaka
ALGORITHMS AND COMPUTATION, ISAAC 2014, 2014, 8889 : 208 - 219
[23] Tractable minor-free generalization of planar zero-field Ising models
Likhosherstov, Valerii
Maximov, Yury
Chertkov, Michael
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2020, 2020 (12):
[24] Fixed-Parameter Tractability of Graph Isomorphism in Graphs with an Excluded Minor
Lokshtanov, Daniel
Pilipczuk, Marcin
Pilipczuk, Michal
Saurabh, Saket
PROCEEDINGS OF THE 54TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '22), 2022, : 914 - 923
[25] Fixed-parameter algorithms for the (k, r)-center in planar graphs and map graphs
Demaine, ED
Fomin, FV
Hajiaghayi, MT
Thilikos, DM
AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2003, 2719 : 829 - 844
[26] Fixed-Parameter Algorithms for (k, r)-Center in Planar Graphs and Map Graphs
Demaine, Erik D.
Fomin, Fedor V.
Hajiaghayi, Mohammadtaghi
Thilikos, Dimitrios M.
ACM TRANSACTIONS ON ALGORITHMS, 2005, 1 (01) : 33 - 47
[27] The planar directed k-Vertex-Disjoint Paths problem is fixed-parameter tractable
Cygan, Marek
Marx, Daniel
Pilipczuk, Marcin
Pilipczuk, Michal
2013 IEEE 54TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2013, : 197 - 206
[28] Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract)
Arvind, Vikraman
Nedela, Roman
Ponomarenko, Ilia
Zeman, Peter
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2022), 2022, 13453 : 29 - 42
[29] Chordal deletion is fixed-parameter tractable
Marx, Daniel
Graph-Theoretic Concepts in Computer Science, 2006, 4271 : 37 - 48
[30] FINDING DETOURS IS FIXED-PARAMETER TRACTABLE
Bezakova, Ivona
Curticapean, Radu
Dell, Holger
Fomin, Fedor, V
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2019, 33 (04) : 2326 - 2345

← 1 2 3 4 5 →