ConceptTheory & Algos
Bipartite max perfect matching problem
A graph theory problem where the goal is to find a matching in a bipartite graph that matches every vertex and maximizes the total weight.
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.