Applications of flows and cuts
Kent Quanrud · 65:24
This lecture is a two-part algorithms class on reducing combinatorial problems to max-flow / min-cut: the instructor lists several “change the input” applications, then solves bipartite matching (as unit flow), bipart...