ConceptTheory & Algos
Maximal independent set
A subset of graph nodes such that no two neighbors are both in the set, and no more nodes can be added without violating independence.
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
1Nancy Ann Lynch
Connections
7The lectures that define it or assume it, and the concepts next to it.