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 recognize...

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science pp. 407 - 416
Main Authors:	Bojańczyk, Mikołaj, Pilipczuk, Michał
Format:	Conference Proceeding
Language:	English
Published:	New York, NY, USA ACM 05.07.2016
Series:	ACM Conferences
Subjects:	Theory of computation > Logic Monadic Second-Order Logic treewidth recognizability tree decomposition Simon's factorization forest
ISBN:	9781450343916, 1450343910
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!