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

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science s. 407 - 416
Hlavní autori:	Bojańczyk, Mikołaj, Pilipczuk, Michał
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	New York, NY, USA ACM 05.07.2016
Edícia:	ACM Conferences
Predmet:	Theory of computation > Logic Monadic Second-Order Logic treewidth recognizability tree decomposition Simon's factorization forest
ISBN:	9781450343916, 1450343910
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!