max-flow min-cut theorem

E1846972 UNEXPLORED

The max-flow min-cut theorem is a fundamental result in network flow theory stating that the maximum amount of flow that can be sent from a source to a sink in a flow network equals the minimum capacity of any cut separating them.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
max-flow min-cut theorem canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Menger's theorem (graph theory) → relatedTo → max-flow min-cut theorem ⓘ

subject linked to: Menger theorem in graph theory