Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Unweighted Bipartite Matching
Description
This lecture covers the unweighted bipartite matching problem and its solution using linear programming. The instructor explains the definition of unweighted bipartite matching, the algorithm for finding the matching, and the concept of alternating paths. The lecture also introduces the concept of augmenting paths and the simplex method for solving the problem.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.