Sciweavers

Share
FAW
2008
Springer
111views Algorithms» more  FAW 2008»
9 years 1 months ago
Efficient First-Order Model-Checking Using Short Labels
We prove that there exists an O(log(n))-labeling scheme for every first-order formula with free set variables in every class of graphs that is nicely locally cwd-decomposable, whic...
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha...
books