A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Contraction Bidimensionality of Geometric Intersection Graphs
[article]
2022
arXiv
pre-print
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
arXiv:2207.09751v1
fatcat:pley34pjujbhnl3yps52bofala