Network Flow
Kent Quanrud · 75:55 · Watch on YouTube
The lecture opens by recapping the previous class on network flow: maximum edge-disjoint S-T path packing versus minimum S-T cut, and the duality between them (an edge is packed into a path iff the path uses it). The...