Ignore this box please.
More
Settings
Goodies
About
Help
Feedback
PRIVACY
DontTrack
DontBubble
Policy
COMMUNITY
Platform
Forum
Chat
Spread
Keyboard shortcuts
h, / search box
j, ↓ next result
k, ↑ prev result
l, o, Enter go
More...
Ctrl+Enter bg
', v new tab
d domain search
t Top
!, 1 !bang dropdown
esc out of bangs
s Did you mean
r related topics
m main results
More explanation...
Max-flow min-cut theorem
In optimization theory, the max-flow min-cut theorem states that in a flow network, the maximum amount of flow passing from the source to the sink is equal to the minimum capacity which when removed in a specific way from the network causes the situation that no flow can pass from the source to the sink.
More at Wikipedia
Linear programming
Maximum flow
More related topics
Minimum cut
Flow network
Edmonds-Karp algorithm
Combinatorial optimization
This page requires Javascript.Get the non-JS version
here
.