Vertex Deletion Parameterized by Elimination Distance and Even Less

by   Bart M. P. Jansen, et al.

We study the parameterized complexity of various classic vertex deletion problems such as Odd cycle transversal, Vertex planarization, and Chordal vertex deletion under hybrid parameterizations. Existing FPT algorithms for these problems either focus on the parameterization by solution size, detecting solutions of size k in time f(k) · n^O(1), or width parameterizations, finding arbitrarily large optimal solutions in time f(w) · n^O(1) for some width measure w like treewidth. We unify these lines of research by presenting FPT algorithms for parameterizations that can simultaneously be arbitrarily much smaller than the solution size and the treewidth. We consider two classes of parameterizations which are relaxations of either treedepth of treewidth. They are related to graph decompositions in which subgraphs that belong to a target class H (e.g., bipartite or planar) are considered simple. First, we present a framework for computing approximately optimal decompositions for miscellaneous classes H. Namely, if the cost of an optimal decomposition is k, we show how to find a decomposition of cost k^O(1) in time f(k) · n^O(1). Secondly, we exploit the constructed decompositions for solving vertex-deletion problems by extending ideas from algorithms using iterative compression and the finite state property. For the three mentioned vertex-deletion problems, and all problems which can be formulated as hitting a finite set of connected forbidden (a) minors or (b) (induced) subgraphs, we obtain FPT algorithms with respect to both studied parameterizations.



page 1

page 2

page 3

page 4


FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More

For a hereditary graph class ℋ, the ℋ-elimination distance of a graph G ...

Parameterized Complexity of Deletion to Scattered Graph Classes

Graph-modification problems, where we add/delete a small number of verti...

Parameterized complexity of fair deletion problems II

Vertex deletion problems are those where given a graph G and a graph pro...

Decomposition of Map Graphs with Applications

Bidimensionality is the most common technique to design subexponential-t...

Losing Treewidth by Separating Subsets

We study the problem of deleting the smallest set S of vertices (resp.ed...

Towards exact structural thresholds for parameterized complexity

Parameterized complexity seeks to use input structure to obtain faster a...

SAT-Encodings for Treecut Width and Treedepth

In this paper we propose, implement, and test the first practical decomp...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.