ConceptTheory & Algos
Bounded-search-tree algorithm
An algorithm design technique for fixed-parameter tractable problems where branching decisions are made at each step to exhaustively search a tree whose depth is bounded by the parameter.
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
4The lectures that define it or assume it, and the concepts next to it.