Algorithmic Meta Theorems for Sparse Graph Classes [chapter]

Martin Grohe
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
more » ... nadic second-order logic are decidable in linear time. This paper is a brief and nontechnical survey of the most important algorithmic meta theorems.
doi:10.1007/978-3-319-06686-8_2 fatcat:cr656t7vjbgxjkdjkcldpksgwm