LP&CO 2026 Lecture-32: Formalizing the algorithm for finding a perfect matching in bipartite graphs
0:00 · Watch on YouTube
A bipartite graph has a perfect matching exactly when an alternating-tree search either augments a matching up to a perfect one or stops on a Hall violator, and that same search is the subroutine for minimum-cost perf...