Definability equals recognizability fork-outerplanar graphs andl-chordal partialk-trees
نویسندگان
چکیده
منابع مشابه
Definability Equals Recognizability for 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 [6]. These algorithms are constructed as finite state tree automata, and hence every CMSOL-definable graph property is recognizable. ...
متن کاملDefinability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees
One of the most famous algorithmic meta-theorems states that every graph property which can be defined in counting monadic second order logic (CMSOL) can be checked in linear time on graphs of bounded treewidth, which is known as Courcelle’s Theorem [12]. These algorithms are constructed as finite state tree automata and hence every CMSOL-definable graph property is recognizable. Courcelle also...
متن کامل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 [8]. These algorithms are constructed as finite state tree automata, and hence every CMSOL-definable graph property is recognizable. ...
متن کاملRecognizability Equals Definability for Partial k-Paths
We prove that every recognizable family of partial k-paths is deenable in a counting monadic second-order logic. We also show the obstruction set of the class of partial k-paths computable for every k.
متن کاملRecognizability Equals Monadic Second-Order Definability for Sets of Graphs of Bounded Tree-Width
We prove that for each k, there exists a MSO-transduction that associates with every graph of tree-width at most k one of its tree-decompositions of width at most k. Courcelle proves in (The Monadic second-order logic of graphs, I: Recognizable sets of nite graphs) that every set of graphs is recognizable if it is deenable in Counting Monadic Second-Order logic. It follows that every set of gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2017
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2017.06.025