Courcelle’s theorem—A game-theoretic approach☆
Under an Elsevier user license
open archive
Highlights
► MSO-definable problems can be solved in linear time on graphs of bounded treewidth. ► Construction of tree automata often fails in practice due to state explosion. ► A new game-theoretic approach is introduced to avoid the power set construction. ► Experiments indicate feasibility.
Keywords
Parameterized algorithms
Model checking
Monadic Second-Order logic
Treewidth
Cited by (0)
Copyright © 2011 Elsevier B.V. All rights reserved.