Faster parameterized algorithms for modification problems to minor-closed classes

10/05/2022
by   Laure Morelle, et al.
0

Let G be a minor-closed graph class and let G be an n-vertex graph. We say that G is a k-apex of G if G contains a set S of at most k vertices such that G∖ S belongs to G. Our first result is an algorithm that decides whether G is a k-apex of G in time 2^ poly(k)· n^2, where poly is a polynomial function depending on G. This algorithm improves the previous one, given by Sau, Stamoulis, and Thilikos [ICALP 2020], whose running time was 2^ poly(k)· n^3. The elimination distance of G to G, denoted by ed_ G(G), is the minimum number of rounds required to reduce each connected component of G to a graph in G by removing one vertex from each connected component in each round. Bulian and Dawar [Algorithmica 2017] provided an FPT-algorithm, with parameter k, to decide whether ed_ G(G)≤ k. However, its dependence on k is not explicit. We extend the techniques used in the first algorithm to decide whether ed_ G(G)≤ k in time 2^2^2^ poly(k)· n^2. This is the first algorithm for this problem with an explicit parametric dependence in k. In the special case where G excludes some apex-graph as a minor, we give two alternative algorithms, running in time 2^2^ O(k^2log k)· n^2 and 2^ poly(k)· n^3 respectively, where c and poly depend on G. As a stepping stone for these algorithms, we provide an algorithm that decides whether ed_ G(G)≤ k in time 2^ O( tw· k+ twlog tw)· n, where tw is the treewidth of G. Finally, we provide explicit upper bounds on the size of the graphs in the minor-obstruction set of the class of graphs E_k( G)={G| ed_ G(G)≤ k}.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/27/2020

An FPT-algorithm for recognizing k-apices of minor-closed graph classes

Let G be a graph class. We say that a graph G is a k-apex of G if G cont...
research
03/01/2021

k-apices of minor-closed graph classes. I. Bounding the obstructions

Let G be a minor-closed graph class. We say that a graph G is a k-apex o...
research
06/08/2021

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

For a hereditary graph class ℋ, the ℋ-elimination distance of a graph G ...
research
01/22/2022

Faster ILP Algorithms for Problems with Sparse Matrices and Their Applications to Multipacking and Multicover Problems in Graphs and Hypergraphs

Let P be a polyhedron, defined by a system A x ≤ b, where A ∈ Z^m × n, r...
research
11/29/2017

A note on time hierarchies for reasonable semantic classes without advice

We show time hierarchies for reasonable semantic classes without advice ...
research
04/05/2019

Reducing Topological Minor Containment to the Unique Linkage Theorem

In the Topological Minor Containment problem (TMC) problem two undirecte...
research
06/28/2021

Isomorphism Testing Parameterized by Genus and Beyond

We present an isomorphism test for graphs of Euler genus g running in ti...

Please sign up or login with your details

Forgot password? Click here to reset