16 Sep, 2021

Courses βΈ± Algorithms
You can also access the quiz on Itempool here if you want to practice, or see the notes below for more context.

Lecture Recording

In-class Quiz Questions

πŸ“
We demonstrated how you can solve the problem of finding a maximum matching in a bipartite graph by reducing/converting it to the problem of finding a maximum flow in an appropriately constructed flow network.