ConceptTheory & Algos
Min-weight matching
A min-weight matching for a graph is a perfect matching that achieves the minimum possible total weight among all possible perfect matchings.
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
5The lectures that define it or assume it, and the concepts next to it.