ConceptTheory & Algos
Nice tree decomposition
A binary tree decomposition where every node has at most two children and falls into one of four types: leaf, introduce, forget, or join.
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
1Connections
4The lectures that define it or assume it, and the concepts next to it.