Dates

31. 10. Introduction to matchings, algorithm for perfect matchings in bipartite graphs, Edmonds' algorithm for perfect matchings in general graphs
7. 11. Edmonds' algorithm for maximal matchings; the assignment problem; weighted matchings in bipartite graphs (Hungarian algorithm)

Reading

Cook, Cunningham, Pulleybank, Schrijver: Combinatorial optimization [Section 5.1] [PDF]
For the Hungarian algorithm try the interactive materials at TU Munchen [link]

Historical references

• Edmonds, Jack (1965). "Paths, trees, and flowers". Canad. J. Math. 17: 449–467. doi:10.4153/CJM-1965-045-4

Slides