Network Flow: From Ford-Fulkerson to Push-Relabel and the Max-Flow Min-Cut TheoremA rigorous journey through the algorithms that solve maximum flow—Ford-Fulkerson, Edmonds-Karp, Dinic, and Push-Relabel—together with the duality that binds flows to cuts.
