ConceptTheory & Algos
Max-independent-set
The problem of finding the largest subset of graph vertices that contain no edges between them.
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.
Graph theory1
Lecturers
1Connections
1The lectures that define it or assume it, and the concepts next to it.