ConceptAI & ML
Tree decomposition
Creating a tree-structured graph of mega-variables where each mega-variable encodes part of the original CSP and subproblems overlap to ensure consistent solutions.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Ryan O'Donnell
A tree decomposition of a general graph G=(V,E) is a tree T whose vertices are called bags X such that every edge has its endpoints together in at least one bag, and for every vertex, the bags containing it form a connected subtree in T.
Lectures that assume it
2Connections
14The lectures that define it or assume it, and the concepts next to it.