Graph Algorithms
Chapter 8: Maximum Matchings 1
Section 1:
Matchings in graphs. Bipartite graphs.
Notes
Section 2:
Covers in graphs. Relationship between covers and matchings.
Notes
Section 3:
Recognising bipartite graphs. Extending a matching using an M-augmenting path.
Notes
Chapter 7
Chapter 9
Back to Graph Algorithms main page