Network flow
Kent Quanrud · 81:36
This lecture extends last week’s edge-disjoint \(s\)–\(t\) paths / min-cut duality to capacitated max flow: a feasible flow is an assignment of (possibly fractional) values to directed edges obeying capacity and conse...