19 research outputs found
Definability Equals Recognizability for -Outerplanar Graphs
One of the most famous algorithmic meta-theorems states that every graph
property that can be defined by a sentence in counting monadic second order
logic (CMSOL) can be checked in linear time for graphs of bounded treewidth,
which is known as Courcelle's Theorem. These algorithms are constructed as
finite state tree automata, and hence every CMSOL-definable graph property is
recognizable. Courcelle also conjectured that the converse holds, i.e. every
recognizable graph property is definable in CMSOL for graphs of bounded
treewidth. We prove this conjecture for -outerplanar graphs, which are known
to have treewidth at most .Comment: 40 pages, 8 figure
MSOL-Definability Equals Recognizability for Halin Graphs and Bounded Degree k-Outerplanar Graphs
One of the most famous algorithmic meta-theorems states that every graph property that can be defined by a sentence in counting monadic second order logic (CMSOL) can be checked in linear time for graphs of bounded treewidth, which is known as Courcelle's Theorem. These algorithms are constructed as finite state tree automata, and hence every CMSOL-definable graph property is recognizable. Courcelle also conjectured that the converse holds, i.e. every recognizable graph property is definable in CMSOL for graphs of bounded treewidth. We prove this conjecture for a number of special cases in a stronger form. That is, we show that each recognizable property is definable in MSOL, i.e. the counting operation is not needed in our expressions. We give proofs for Halin graphs, bounded degree k-outerplanar graphs and some related graph classes. We furthermore show that the conjecture holds for any graph class that admits tree decompositions that can be defined in MSOL, thus providing a useful tool for future proofs
Definability equals recognizability for graphs of bounded treewidth
We prove a conjecture of Courcelle, which states that a graph property is
definable in MSO with modular counting predicates on graphs of constant
treewidth if, and only if it is recognizable in the following sense:
constant-width tree decompositions of graphs satisfying the property can be
recognized by tree automata. While the forward implication is a classic fact
known as Courcelle's theorem, the converse direction remained openComment: 21 pages, an extended abstract will appear in the proceedings of LICS
201
On Supergraphs Satisfying CMSO Properties
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)⋅2O(Δ⋅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)⋅2O(Δ⋅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.publishedVersio
On Supergraphs Satisfying CMSO Properties
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 F, a positive integer t, and a connected graph G of maximum degree at most D, and determines, in time f(|F|,t)*2^O(D*t)*|G|^O(t), whether G has a supergraph G\u27 of treewidth at most t such that G\u27 satisfies F.
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*d)*|G|^O(d), whether a connected graph of maximum degree D has a planar supergraph of diameter at most d. Additionally, we show that for each fixed k, the problem of determining whether G has a 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
On Supergraphs Satisfying CMSO Properties
Let CMSO denote the counting monadic second order logic of graphs. We give a
constructive proof that for some computable function , there is an algorithm
that takes as input a CMSO sentence , a positive
integer , and a connected graph of maximum degree at most , and
determines, in time , whether has a supergraph of treewidth at most such
that . 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 , whether a connected graph of maximum degree has a planar
supergraph of diameter at most . Additionally, we show that for each fixed
, the problem of determining whether has an -outerplanar supergraph
of diameter at most is strongly uniformly fixed parameter tractable with
respect to the parameter . This result can be generalized in two directions.
First, the diameter parameter can be replaced by any contraction-closed
effectively CMSO-definable parameter . 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
Minor-Obstructions for Apex-Pseudoforests
A graph is called a pseudoforest if none of its connected components contains
more than one cycle. A graph is an apex-pseudoforest if it can become a
pseudoforest by removing one of its vertices. We identify 33 graphs that form
the minor-obstruction set of the class of apex-pseudoforests, i.e., the set of
all minor-minimal graphs that are not apex-pseudoforests
MinorObstructions for Apex Pseudoforests
Ένα γράφημα ανήκει στην κλάση των ψευδοδασών αν κάθε συνεκτική συνιστώσα του
περιέχει το πολύ έναν κύκλο. Ένα γράφημα είναι απόγειοψευδοδάσος αν μπορεί να
μετατραπεί σε ψευδοδάσος με την αφαίρεση μίας κορυφής. Έχουμε εντοπίσει τα 33
γραφήματα τα οποία αποτελούν το σύνολο παρεμπόδισης για την κλάση γραφημάτων
απόγειαψευδοδάση, δηλαδή τα ελαχιστικά γραφήματα ως προς την σχέση του
ελάσσονος, τα οποία δεν είναι απόγειαψευδοδάση.A graph is called a pseudoforest if none of its connected components contains more
than one cycle. A graph is an apexpseudoforest if it can become a pseudoforest by
removing one of its vertices. We identify 33 graphs that form the minor obstruction set
of the class of apexpseudoforests, i.e., the set of all minorminimal graphs that are not
apexpseudoforests
Logic and Automata
Mathematical logic and automata theory are two scientific disciplines with a fundamentally close relationship. The authors of Logic and Automata take the occasion of the sixtieth birthday of Wolfgang Thomas to present a tour d'horizon of automata theory and logic. The twenty papers in this volume cover many different facets of logic and automata theory, emphasizing the connections to other disciplines such as games, algorithms, and semigroup theory, as well as discussing current challenges in the field