ConceptTheory & Algos
Polynomial kernel for vertex cover
A kernelization algorithm for vertex cover that produces an equivalent instance whose size is bounded by a polynomial in k.
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
3The lectures that define it or assume it, and the concepts next to it.