The Augmenting Path Algorithm for Bipartite Matching
Find a maximum matching and a minimum vertex cover in a bipartite graph using M-augmenting paths. This algorithm will either output an M-augmenting path or a vertex cover with size equal to the size of the matching.
▶︎
Bipartite Graphs and Maximum Matching
▶︎
ADS1: De Bruijn graphs and Eulerian walks
▶︎
The Augmenting Path Algorithm (Example)
▶︎
The Blossom Algorithm
▶︎
How do we OPTIMALLY assign drivers to riders? (Hungarian Algorithm) | Bipartite Matchings
▶︎
Matchings, Perfect Matchings, Maximum Matchings, and More! | Graph Theory
▶︎
The Pricing Method
▶︎
2.11.7 Bipartite Matching
▶︎
A Second Course in Algorithms (Lecture 5: Minimum-Cost Bipartite Matching)
▶︎
Sharkey: Applying the Augmenting Path Algorithm to Solve a Maximum Flow Problem
▶︎
How to Tell if Graph is Bipartite (by hand) | Graph Theory
▶︎
Why Aliens Would NEVER Invade Africa
▶︎
Dijkstras Shortest Path Algorithm Explained | With Example | Graph Theory
▶︎
Proof: Hall's Marriage Theorem for Bipartite Matchings | Graph Theory
▶︎
DUNE Ambience for Work and Study - 3 Hours
▶︎
The Strange Math That Predicts (Almost) Anything
▶︎
The Ford-Fulkerson Algorithm
▶︎
Can we assign everyone a job? (maximum matchings) | Bipartite Matchings
▶︎
Lecture - 23 Bipartite Maximum Matching
▶︎