Contraction Bidimensionality of Geometric Intersection Graphs

07/20/2022
by   Julien Baste, et al.
0

Given a graph G, we define bcg(G) as the minimum k for which G can be contracted to the uniformly triangulated grid Γ_k. A graph class G has the SQGC property if every graph G∈ G has treewidth 𝒪( bcg(G)^c) for some 1≤ c<2. The SQGC property is important for algorithm design as it defines the applicability horizon of a series of meta-algorithmic results, in the framework of bidimensionality theory, related to fast parameterized algorithms, kernelization, and approximation schemes. These results apply to a wide family of problems, namely problems that are contraction-bidimensional. Our main combinatorial result reveals a wide family of graph classes that satisfy the SQGC property. This family includes, in particular, bounded-degree string graphs. This considerably extends the applicability of bidimensionality theory for contraction bidimensional problems.

READ FULL TEXT
research
06/18/2020

On the Parameterized Approximability of Contraction to Classes of Chordal Graphs

A graph operation that contracts edges is one of the fundamental operati...
research
08/18/2020

On the Parameterized Complexity Of Grid Contraction

For a family of graphs 𝒢, the 𝒢-Contraction problem takes as an input a ...
research
05/04/2021

Approximation schemes for bounded distance problems on fractionally treewidth-fragile graphs

We give polynomial-time approximation schemes for monotone maximization ...
research
04/26/2023

Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs

We investigate a fundamental vertex-deletion problem called (Induced) Su...
research
11/04/2021

A Compound Logic for Modification Problems: Big Kingdoms Fall from Within

We introduce a novel model-theoretic framework inspired from graph modif...
research
07/20/2023

Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction

In this work, we initiate the complexity study of Biclique Contraction a...
research
01/27/2022

An Algorithmic Framework for Locally Constrained Homomorphisms

A homomorphism f from a guest graph G to a host graph H is locally bijec...

Please sign up or login with your details

Forgot password? Click here to reset