A Second Course in Algorithms (Lecture 6: Generalizations of Maximum Flow and Bipartite Matching)

Finish the Hungarian algorithm. Survey of efficiently solvable generalizations of maximum flow and min-cost bipartite matching (min-cost flow, nonbipartite matching, etc.). Full course playlist:    • A Second Course in Algorithms (Stanford CS...   Lecture notes: http://timroughgarden.org/w16/l/l6.pdf