ConceptTheory & Algos
Max independent set on trees
An NP-hard maximum independent set problem that can be solved in polynomial time on trees using dynamic programming by considering subtrees rooted at each vertex.
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.