Slides.

STEPHAN KREUTZER COMPLEXITY OF MODEL-CHECKING PROBLEMS 36/81
INTRODUCTION COMPLEXITY UPPER BOUNDS COMPOSITION LOCALITY LOCALISATION GRIDS GRID-LIKE MINORS LABELLED WEBS
First Step
Algorithm: First Step
for all v ∈ V(G)
• compute N r (v)
• test whether N r (v) |= ψ(v)
(constant size neighbourhood)
if it does, colour the vertex red
Running time: O(n)
O(n)
O(d r ) = O(1)
O(1)