
Hitting minors on bounded treewidth graphs. III. Lower bounds
For a finite collection of graphs F, the FMDELETION problem consists i...
read it

Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
For a finite collection of graphs F, the FTMDeletion problem has as ...
read it

On link deletion and point deletion in games on graphs
We discuss link and point deletion operators on graph games and provide ...
read it

A Turing Kernelization Dichotomy for Structural Parameterizations of FMinorFree Deletion
For a fixed finite family of graphs F, the FMinorFree Deletion problem...
read it

On the Parameterized Complexity of Deletion to Hfree Strong Components
Directed Feedback Vertex Set (DFVS) is a fundamental computational prob...
read it

Towards exact structural thresholds for parameterized complexity
Parameterized complexity seeks to use input structure to obtain faster a...
read it

Decomposition of Map Graphs with Applications
Bidimensionality is the most common technique to design subexponentialt...
read it
Hitting minors on bounded treewidth graphs. II. Singleexponential algorithms
For a finite collection of graphs F, the FMDELETION (resp. FTMDELETION) problem consists in, given a graph G and an integer k, decide whether there exists S ⊆ V(G) with S ≤ k such that G ∖ S does not contain any of the graphs in F as a minor (resp. topological minor). We are interested in the parameterized complexity of both problems when the parameter is the treewidth of G, denoted by tw, and specifically in the cases where F contains a single connected planar graph H. We present algorithms running in time 2^O(tw)· n^O(1), called singleexponential, when H is either P_3, P_4, C_4, the paw, the chair, and the banner for both {H}MDELETION and {H}TMDELETION, and when H=K_1,i, with i ≥ 1, for {H}TMDELETION. Some of these algorithms use the rankbased approach introduced by Bodlaender et al. [Inform Comput, 2015]. This is the second of a series of articles on this topic, and the results given here together with other ones allow us, in particular, to provide a tight dichotomy on the complexity of {H}MDELETION in terms of H.
READ FULL TEXT
Comments
There are no comments yet.