Bipartite Matching (17)

Michael L. Littman

November 6th, 1997

• ANNOUNCEMENTS
• MATCHING PROBLEM
  • Teaching Assignments
  • Example Semester
  • Bipartite Graphs
  • Matching
  • Max Matchings
  • Finding a Max Matching
• MIN-CUT MAX-FLOW
  • Augmenting Path
  • Augmenting Path Facts
  • Algorithm
  • Cuts
  • Max-flow Min-cut Theorem
  • Proof of Max-flow Min-cut
• FORD-FULKERSON METHOD
  • Review
  • Augmenting-Path Algorithm
  • Overall Running Time
• GENERALIZATIONS
  • Network Flow
  • Linear Programming
• HOMEWORK
  • Homework 8
  • Homework 9