In a flow network, the maximum value of an s-t flow equals the minimum capacity of an s-t cut. Ford-Fulkerson (1956). Dualises to bipartite matching (König).
In a flow network, the maximum value of an s-t flow equals the minimum capacity of an s-t cut. Ford-Fulkerson (1956). Dualises to bipartite matching (König).