Ford and Fulkerson: Maximal flow through a network

What changed

Linked maximum flow to minimum cut and supplied an augmenting-flow scheme for the stated network model.

Scientific scope

The record is the exact two-author 1956 Canadian Journal of Mathematics paper. It does not absorb earlier linear-programming formulations, later Edmonds-Karp complexity bounds or every network-flow extension.

Evidence

The linked sources identify this contribution and its scope. WRS has not independently reconstructed the scientific claims. The record is the exact two-author 1956 Canadian Journal of Mathematics paper. It does not absorb earlier linear-programming formulations, later Edmonds-Karp complexity bounds or every network-flow extension.

Contributors

• Lester R. Ford Jr. · SCIENCE: Named source author of the scoped work; individual effort shares are not measured.
• Delbert R. Fulkerson · SCIENCE: Named source author of the scoped work; individual effort shares are not measured.

• Yale-hosted Ford-Fulkerson 1956 full text

Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.

Full scientific record · Browse contribution grades · Request a correction