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 条

[31] Fixed Parameter Tractable Algorithms in Combinatorial Topology
Burton, Benjamin A.
Pettersson, William
COMPUTING AND COMBINATORICS, COCOON 2014, 2014, 8591 : 300 - 311
[32] Chordal Deletion is Fixed-Parameter Tractable
Dániel Marx
Algorithmica, 2010, 57 : 747 - 768
[33] Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
Alber, J
Bodlaender, HL
Fernau, H
Kloks, T
Niedermeier, R
ALGORITHMICA, 2002, 33 (04) : 461 - 493
[34] Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs
Algorithmica, 2002, 33 : 461 - 493
[35] Rotation distance is fixed-parameter tractable
Cleary, Sean
John, Katherine St.
INFORMATION PROCESSING LETTERS, 2009, 109 (16) : 918 - 922
[36] Fixed-Parameter Tractable Reductions to SAT
de Haan, Ronald
Szeider, Stefan
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2014, 2014, 8561 : 85 - 102
[37] Connecting face hitting sets in planar graphs
Schweitzer, Pascal
Schweitzer, Patrick
INFORMATION PROCESSING LETTERS, 2010, 111 (01) : 11 - 15
[38] Colored Hypergraph Isomorphism is Fixed Parameter Tractable
V. Arvind
Bireswar Das
Johannes Köbler
Seinosuke Toda
Algorithmica, 2015, 71 : 120 - 138
[39] Interval Deletion Is Fixed-Parameter Tractable
Cao, Yixin
Marx, Daniel
ACM TRANSACTIONS ON ALGORITHMS, 2015, 11 (03)
[40] Colored Hypergraph Isomorphism is Fixed Parameter Tractable
Arvind, V.
Das, Bireswar
Koebler, Johannes
Toda, Seinosuke
IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2010), 2010, 8 : 327 - 337

← 1 2 3 4 5 →