Lecture - 23 Bipartite Maximum Matching
About this video
Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidenceThis lecture covers bipartite maximum matching, a graph algorithm. It teaches methods for solving network flow and assignment problems.
A 51-minute video from nptelhrd: “Lecture - 23 Bipartite Maximum Matching”.
Video by nptelhrd, played through YouTube's embedded player.