Flow network
Learn feasible flows, residual forward and reverse arcs, augmenting paths, cut bounds, and when Ford–Fulkerson terminates.
2 articles.
Learn feasible flows, residual forward and reverse arcs, augmenting paths, cut bounds, and when Ford–Fulkerson terminates.
A proof of the max-flow min-cut theorem using residual reachability, with a concrete flow-and-cut certificate.