Construct · 1 fields · 1 citations

max-flow min-cut theorem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
max-flowmin-cut theorem1 CONSTRUCTMax-flow min-cut theoremFORD · GRAPH THEORY

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Graph theory

the result that the largest flow a network can carry from source to sink equals the smallest total capacity of a cut separating them.

In graph theory, max-flow min-cut theorem refers to the result that the largest flow a network can carry from source to sink equals the smallest total capacity of a cut separating them. This meaning comes from Ford (1956) in Canadian Journal of Mathematics.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how max-flow min-cut theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

cut2 fields · 2 citationsjingle · one word, two constructssource4 fields · 4 citationsjingle · one word, four constructscapacity5 fields · 8 citationsjingle · one word, four limits

References

  1. Ford, L. R., & Fulkerson, D. R. (1956). Maximal Flow Through a Network. Canadian Journal of Mathematics, 8, 399-404. https://doi.org/10.4153/cjm-1956-045-5

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct