A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Algorithmic Meta Theorems for Sparse Graph Classes
[chapter]

2014
*
Lecture Notes in Computer Science
*

Algorithmic meta theorems give efficient algorithms for classes of algorithmic problems, instead of just individual problems. They unify families of algorithmic results obtained by similar techniques and thus exhibit the core of these techniques. The classes of problems are typically defined in terms of logic and structural graph theory. A well-known example of an algorithmic meta theorem is Courcelle's Theorem, stating that all properties of graphs of bounded tree width that are definable in

doi:10.1007/978-3-319-06686-8_2
fatcat:cr656t7vjbgxjkdjkcldpksgwm