fa26-cs577 cs577
Lecture 15: Applications of Maximum Flow Lecture 15: Applications of Maximum Flow
Content locked
The catalog is public. Reading this content requires approved access.
Sign in to readLecture 15: Applications of Maximum Flow
Residual networks encode reversible decisions
Why stopping proves optimality
Termination, integrality, and path selection
Bipartite matching as flow
Capacitated assignment: ice-cream scoops
Baseball elimination
Project selection as minimum cut
Source acknowledgments and practice