Slides.
Slides.
Slides.
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
STEPHAN KREUTZER COMPLEXITY OF MODEL-CHECKING PROBLEMS 38/81<br />
INTRODUCTION COMPLEXITY UPPER BOUNDS COMPOSITION LOCALITY LOCALISATION GRIDS GRID-LIKE MINORS LABELLED WEBS<br />
First-Order Logic on Bounded Degree Graphs<br />
Theorem: (Seese, 1996)<br />
Let C be a class of graphs of maximum degree at most d ≥ 1.<br />
MC(FO, C)<br />
Input:<br />
Parameter:<br />
Problem:<br />
Graph G ∈ C, ϕ ∈ FO<br />
|ϕ|<br />
Decide G |= ϕ<br />
is fixed-parameter tractable (linear time fpt algorithm).<br />
But wait:<br />
The proof shows much more ...<br />
... for, where did we use bounded degree?
Change language