Skip to Main content Skip to Navigation
Conference papers

A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary

Julien Baste 1 Ignasi Sau Valls 1 Dimitrios M. Thilikos 1
1 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : For a fixed connected graph H, the {H}-M-Deletion problem asks, given a graph G, for the minimum number of vertices that intersect all minor models of H in G. It is known that this problem can be solved in time f (tw) · n O(1) , where tw is the treewidth of G. We determine the asymptotically optimal function f (tw), for each possible choice of H. Namely, we prove that, under the ETH, f(tw) = 2Θ(tw) if H is a contraction of the chair or the banner, and f(tw) = 2Θ(tw·log tw) otherwise. Prior to this work, such a complete characterization was only known when H is a planar graph with at most five vertices. For the upper bounds, we present an algorithm in time 2Θ(tw·log tw) ·nO(1) for the more general problem where all minor models of connected graphs in a finite family F need to be hit. We combine several ingredients such as the machinery of boundaried graphs in dynamic programming via representatives, the Flat Wall Theorem, Bidimensionality, the irrelevant vertex technique, treewidth modulators, and protrusion replacement. In particular, this algorithm vastly generalizes a result of Jansen et al. [SODA 2014] for the particular case F = {K5, K3,3}. For the lower bounds, our reductions are based on a generic construction building on the one given by the authors in [IPEC 2018], which uses the framework introduced by Lokshtanov et al. [SODA 2011] to obtain superexponential lower bounds.
Document type :
Conference papers
Complete list of metadata

Cited literature [49 references]  Display  Hide  Download
Contributor : Isabelle Gouat <>
Submitted on : Thursday, November 5, 2020 - 9:18:57 PM
Last modification on : Friday, November 20, 2020 - 11:56:02 AM
Long-term archiving on: : Saturday, February 6, 2021 - 8:18:02 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License




Julien Baste, Ignasi Sau Valls, Dimitrios M. Thilikos. A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary. 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Jan 2020, Salt Lake City, UT, United States. pp.951-970, ⟨10.1137/1.9781611975994.57⟩. ⟨lirmm-02991215⟩



Record views


Files downloads