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
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.
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.