Graph Algorithms

Chapter 9: Maximum Matchings 2

 
Section 1:
Non-bipartite graphs: obstacles to finding M-augmenting paths. Read PDF file icon
Section 2:
König's Algorithm for bipartite matching. Read PDF file icon
Section 3:
König's minimax theorem relating maximum matchings and minimum covers. Read PDF file icon
Question set PDF file icon   Solutions PDF file icon

Chapter 8 Chapter 10 Back to Graph Algorithms main page