What is recorded here?
Proved the max-flow/min-cut relation for the paper's network model and supplied an effective augmenting-flow computational scheme.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
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.
Read the original work
- Cambridge publisher record for Maximal flow through a network
- Yale-hosted Ford-Fulkerson 1956 full text
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
Lester R. Ford Jr.; Delbert R. Fulkerson
The named authors contributed to this scoped work; individual effort shares and later applications are not assigned by the byline.
Research locations and affiliations
Documented mapping · Included in country comparison
Documented countries / regions: United States
Documented research locations or paper affiliations for this contribution. Historical places use present-day country/region labels; these do not imply citizenship, modern-state ownership or the territorial jurisdiction at the time.
English catalogue narrative
Ford and Fulkerson: Maximal flow through a network
Proved the max-flow/min-cut relation for the paper's network model and supplied an effective augmenting-flow computational scheme.
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.
Reading status
This is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.
People and systems
Lester R. Ford Jr.; Delbert R. Fulkerson
The named authors contributed to this scoped work; individual effort shares and later applications are not assigned by the byline.