DeepAI AI Chat
Log In Sign Up

On Supergraphs Satisfying CMSO Properties

by   Mateus de Oliveira Oliveira, et al.
University of Bergen

Let CMSO denote the counting monadic second order logic of graphs. We give a constructive proof that for some computable function f, there is an algorithm A that takes as input a CMSO sentence φ, a positive integer t, and a connected graph G of maximum degree at most Δ, and determines, in time f(|φ|,t)· 2^O(Δ· t)· |G|^O(t), whether G has a supergraph G' of treewidth at most t such that G'φ. The algorithmic metatheorem described above sheds new light on certain unresolved questions within the framework of graph completion algorithms. In particular, using this metatheorem, we provide an explicit algorithm that determines, in time f(d)· 2^O(Δ· d)· |G|^O(d), whether a connected graph of maximum degree Δ has a planar supergraph of diameter at most d. Additionally, we show that for each fixed k, the problem of determining whether G has an k-outerplanar supergraph of diameter at most d is strongly uniformly fixed parameter tractable with respect to the parameter d. This result can be generalized in two directions. First, the diameter parameter can be replaced by any contraction-closed effectively CMSO-definable parameter p. Examples of such parameters are vertex-cover number, dominating number, and many other contraction-bidimensional parameters. In the second direction, the planarity requirement can be relaxed to bounded genus, and more generally, to bounded local treewidth.


page 1

page 2

page 3

page 4


Oriented Diameter of Planar Triangulations

The diameter of an undirected or a directed graph is defined to be the m...

Strengthening a theorem of Meyniel

For an integer k ≥ 1 and a graph G, let 𝒦_k(G) be the graph that has ver...

Bounds on the Diameter of Graph Associahedra

Graph associahedra are generalized permutohedra arising as special cases...

The Effect of Planarization on Width

We study the effects of planarization (the construction of a planar diag...

Obstructions to faster diameter computation: Asteroidal sets

An extremity is a vertex such that the removal of its closed neighbourho...

Diameter Minimization by Shortcutting with Degree Constraints

We consider the problem of adding a fixed number of new edges to an undi...