Skip to content

A&DS S04E03. Flows, cuts. Ford-Fulkerson algorithm

Pavel Mavrin49.3K subscribers

3,362 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?

Defines flow networks and cuts, proves the max-flow min-cut theorem, and develops the Ford–Fulkerson augmenting-path method with its analysis over a 98-minute lecture. Part of Pavel Mavrin's English ITMO algorithms course, taught at the board in full detail.

Network flows and cuts, max-flow min-cut theorem and the Ford–Fulkerson algorithm.

Video by Pavel Mavrin, played through YouTube's embedded player.

Part of A&DS English Course