Bipartite Matching
Input: a bipartite graph G=(V,E)
Output: Largest-size set of edges M from E such that each vertex in V is incident to at most one edge of S
Previous slide
Next slide
Back to first slide
View graphic version