Abstract

One of the most famous algorithmic meta-theorems states that every graph property
that can be defined by a sentence in counting monadic second order logic (CMSOL) can
be checked in linear time for graphs of bounded treewidth, which is known as Courcelle's
Theorem. These algorithms are constructed as finite state tree automata, and
... read more