ConceptTheory & Algos
Bipartite max perfect matching
The problem of finding a perfect matching in a bipartite graph that maximizes the sum of the weights on the matched edges.
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
4The lectures that define it or assume it, and the concepts next to it.