ConceptTheory & Algos
Dynamic programming on tree decompositions
A method to solve graph problems by computing table entries bottom-up on a nice tree decomposition, storing whether colorings can be extended to descendant bags.
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.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.