Can we assign everyone a job? (maximum matchings) | Bipartite Matchings
19:19
How do we OPTIMALLY assign drivers to riders? (Hungarian Algorithm) | Bipartite Matchings
18:01
Matchings, Perfect Matchings, Maximum Matchings, and More! | Independent Edge Sets, Graph Theory
21:56
Network Flows: Max-Flow Min-Cut Theorem (& Ford-Fulkerson Algorithm)
11:24
Unweighted Bipartite Matching | Network Flow | Graph Theory
6:09
The Blossom Algorithm
11:07
AALG5: Flow networks, maximum bipartite matching example
12:05
The Ford-Fulkerson Algorithm
8:31