Maximal Flow Through a Network¶
Ford, L. R., & Fulkerson, D. R. (1956). Maximal Flow Through a Network. Canadian Journal of Mathematics, 8, 399-404.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Cut
- First, cuts identify bottlenecks: by the max-flow min-cut theorem, the maximum flow from a source to a sink equals the capacity of the minimum cut separating them, so a system's throughput is decided by its narrowest separating link-set, every other edge being slack relative to that bottleneck.
This sourceProves the max-flow min-cut theorem: maximum s–t flow equals minimum s–t cut capacity, localizing throughput onto the narrowest separating edge-set.
- First, cuts identify bottlenecks: by the max-flow min-cut theorem, the maximum flow from a source to a sink equals the capacity of the minimum cut separating them, so a system's throughput is decided by its narrowest separating link-set, every other edge being slack relative to that bottleneck.
- Network Flow Models
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:6d21408bc9a6 · see in the full table