Discrete Optimization Lecture 8: Weighted Matching and Perfect Matching Problems in Bipartite Graphs
This is a lecture from the course "Discrete Optimization" at the University of Victoria taught in 2025.
The topic of this lecture is an matchings in bipartite graphs, including the Hungarian Algorithm. Lecture notes for this topic can be found at https://extremalcombinatorics.com/opt...