max-flow min-cut theorem¶
The. (1956). max-flow min-cut theorem.
Retired. This entry was not a citation. Our extractor stored an inline prose definition from the article as though it were a bibliographic record, so its title is the name of a concept rather than of a published work. The page is kept because links to it still resolve, but it is withdrawn from the reference list. This entry is kept so the citations that pointed at it still resolve, and so the correction is visible rather than silent.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Max-Flow Analysis
- Read off the min-cut. When no augmenting path is left, the set of saturated links separating source from sink is the minimum cut, and by the max-flow-min-cut theorem its capacity equals the maximum flow.
This sourceIt is what lets a single computation return both the throughput ceiling and the exact set of links that impose it.
- Read off the min-cut. When no augmenting path is left, the set of saturated links separating source from sink is the minimum cut, and by the max-flow-min-cut theorem its capacity equals the maximum flow.
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:614cba92a53b · see in the full table