ConceptTheory & Algos
Courcelle's theorem
A theorem stating that any graph property expressible in extended monadic second-order logic can be decided in linear time on graphs of bounded tree width.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Monadic second-order logic1Tree width1
Lecturers
1Connections
1The lectures that define it or assume it, and the concepts next to it.