Mikołaj Bojańczyk
ABSTRACT
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 open.
- H. L. Bodlaender, P. Heggernes, and J. A. Telle. Recognizability equals definability for graphs of bounded treewidth and bounded chordality. Electronic Notes in Discrete Mathematics, 49:559--568, 2015.Google Scholar
Cross Ref
- H. L. Bodlaender and T. Kloks. Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms, 21(2):358-- 402, 1996. Google ScholarDigital Library
- M. Bojańczyk and S. Lasota. An extension of data automata that captures XPath. Logical Methods in Computer Science, 8(1), 2012.Google Scholar
- B. Courcelle. The Monadic Second-Order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput., 85(1):12--75, 1990. Google ScholarDigital Library
- B. Courcelle. The Monadic Second-Order logic of graphs V: On closing the gap between definability and recognizability. Theor. Comput. Sci., 80(2):153--202, 1991. Google ScholarCross Ref
- B. Courcelle and J. Engelfriet. Graph Structure and Monadic Second-Order Logic --- A Language-Theoretic Approach, volume 138 of Encyclopedia of mathematics and its applications. Cambridge University Press, 2012. Google ScholarDigital Library
- B. Courcelle and J. Engelfriet. Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach, volume 138 of Encyclopedia of mathematics and its applications. Cambridge University Press, 2012. Google ScholarDigital Library
- R. G. Downey and M. R. Fellows. Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, 2013. Google ScholarDigital Library
- M. Grohe and D. Marx. Structure theorem and isomorphism test for graphs with excluded topological subgraphs. SIAM J. Comput., 44(1):114--159, 2015.Google ScholarDigital Library
- L. Jaffke and H. L. Bodlaender. Definability equals recognizability for k-outerplanar graphs. In IPEC'15, volume 43 of LIPIcs, pages 175--186, 2015.Google Scholar
- V. Kabanets. Recognizability equals definability for partial k-paths. In ICALP'97, volume 1256 of LNCS, pages 805--815. Springer, 1997. Google ScholarDigital Library
- D. Kaller. Definability equals recognizability of partial 3-trees and k-connected partial k-trees. Algorithmica, 27(3):348--381, 2000.Google ScholarCross Ref
- M. Kufleitner. The height of factorization forests. In MFCS 2008, volume 5162 of LNCS, pages 443--454. Springer, 2008. Google ScholarDigital Library
- D. Lapoire. Recognizability equals Monadic Second-Order definability for sets of graphs of bounded tree-width. In STACS'98, volume 1373 of LNCS, pages 618--628. Springer, 1998. Google ScholarDigital Library
- I. Simon. Factorization forests of finite height. Theor. Comput. Sci., 72(1):65--94, 1990. Google ScholarDigital Library
Index Terms
- Definability equals recognizability for graphs of bounded treewidth
Recommendations
Monadic datalog over finite structures of bounded treewidth
Bounded treewidth and monadic second-order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we know that any property of finite structures, which is expressible by an MSO ...
Restricted space algorithms for isomorphism on bounded treewidth graphs
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time. We give restricted space algorithms for these problems proving the following results:*Isomorphism for ...
Hitting forbidden subgraphs in graphs of bounded treewidth
We study the complexity of a generic hitting problem H-Subgraph Hitting, where given a fixed pattern graph H and an input graph G, the task is to find a set XV(G) of minimum size that hits all subgraphs of G isomorphic to H. In the colorful variant of ...
Comments