The max-flow min-cut theorem is a statement in optimization theory about maximal flows in flow networks. It states that:

The maximal amount of a flow is equal to the capacity of a minimal cut.

Definition

---

Suppose $G(V,E)$ is a finite directed graph and every edge $(u,v)$ has a capacity $c(u,v)$ (a non-negative real number). Further assume two vertices, the source $s$ and the sink $t$, have been distinguished.

A cut is a split of the nodes into two sets $S$ and $T$, such that $s$ is in $S$ and $t$ is in $T$. Hence there are

$2^\{|V|-2\}\backslash ,$

possible cuts in a graph. The capacity of a cut $(S,T)$ is

$c(S,T)\; =\; \backslash sum\_\{u\; \backslash in\; S,\; v\; \backslash in\; T\; |\; (u,v)\; \backslash in\; E\}\; c(u,v)$,

the sum of the capacity of all the edges crossing the cut, from the region $S$ to the region $T$.

The following three conditions are equivalent:

1. $f$ is a maximum flow in $G$
2. The residual network $G\_f$ contains no augmenting paths.
3. $|f|\; =\; c(S,T)$ for some cut $(S,T)$.

Proof Sketch: If there is an augmenting path, we can send flow along it, and get a greater flow, hence it cannot be maximal, and vice versa. If there is no augmenting path, divide the graph into $S$, the nodes reachable from $s$ in the residual network, and $T$, those not reachable. Then $c(S,T)$ must be 0. If it is not, there is an edge $(u,v)$ with $c(u,v)\; >\; 0$. But then $v$ is reachable from $s$, and cannot be in $T$.

Example

---

Given to the right is a network with nodes $V=\backslash \{s,o,p,q,r,t\backslash \}$, and a total flow from the source $s$ to the sink $t$ of 5, which is maximal in this network. (This is actually the only maximal flow you can assign in this network.)

There are three minimal cuts in this network. For the cut $S=\backslash \{s,p\backslash \},T=\backslash \{o,q,r,t\backslash \}$, the capacity across the cut is $c(s,o)+c(p,r)=3+2=5$. For $S=\backslash \{s,o,p\backslash \},T=\backslash \{q,r,t\backslash \}$ it is $c(o,q)+c(p,r)=3+2=5$. For $S=\backslash \{s,o,p,q,r\backslash \},T=\backslash \{t\backslash \}$ it is $c(q,t)+c(r,t)=2+3=5$.

Notice that $S=\backslash \{s,o,p,r\backslash \},T=\backslash \{q,t\backslash \}$ is not a minimal cut, even though both $(o,q)$ and $(r,t)$ are saturated in the given flow. This is because in the residual network $G\_f$, there is an edge (r,q) with capacity $c\_f(r,q)\; =\; c(r,q)-f(r,q)=0-(-1)=1$.

History

---

The theorem was proved by P. Elias, A. Feinstein, and C.E. Shannon in 1956, and independently also by L.R. Ford, Jr. and D.R. Fulkerson in the same year. Determining maximum flows is a special kind of linear programming problem, and the max flow min cut theorem can be seen as a special case of the duality theorem for linear programming.

External links

---

• A review of current literature on computing maximum flows
• Max-Flow Min-Cut Animation
• Max-Flow Problem: Ford-Fulkerson Algorithm

References

---

• P. Elias, A. Feinstein, and C. E. Shannon. Note on maximum flow through a network. IRE Transactions on Information Theory IT-2, 117--119, 1956.
• Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 2001. ISBN 0262032937. Chapter 26: Maximum Flow, pp.643–700.

Network flow

משפט זרימה־מקסימלית חתך־מינימלי | Теорема Форда — Фалкерсона