ConceptTheory & Algos
Brute-force algorithm for vertex cover
An exact algorithm that tries all subsets of k vertices and tests each for coverage.
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.
Combinations1Vertex cover1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.