Course contentsShow
Mathematics
Lesson 2702 of 3,12153. Graph TheoryPro lesson

The Hungarian Algorithm for Maximum Bipartite Matching

Learn the Hungarian algorithm to find maximum matchings in bipartite graphs by repeatedly finding augmenting paths.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.