Example: dental hygienist

Lecture 4: Matching Algorithms for Bipartite Graphs

Main idea for the algorithm that nds a maximum matching on bipartite graphs comes from the following fact: Given some matching M and an augmenting path P, M 0= M P is a matching with jM j= jMj+1. Here, ’ ’ denotes the symmetric di erence set operation (everything that belongs to both sets individually, but doesn’t belong to their ...

Tags:

  Their, Matching, Algorithm, Graph, Bipartite, Matching algorithms for bipartite graphs

Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Transcription of Lecture 4: Matching Algorithms for Bipartite Graphs

Related search queries