A&DS S04E01. Maximum Matchings in Bipartite Graphs
5,085 views
About this video
Hand-picked by a BrighterTube curator · found via Reddit r/compsci thread: Any recommendations of youtube channels for programming and computer science stuff? · 82% confidenceA full 87-minute lecture on maximum bipartite matching: augmenting paths, Kuhn's algorithm with its correctness proof and running time, and König's theorem. Part of Pavel Mavrin's English ITMO algorithms course, taught at the board in full detail.
Maximum matchings in bipartite graphs: augmenting paths and Kuhn's algorithm.
Video by Pavel Mavrin, played through YouTube's embedded player.
Part of A&DS English Course