Ford-Fulkerson theorem

Ford-Fulkerson theorem (also known as max-flow min-cut theorem) states that over a graph $G$, the maximum flow from a source node $s$ to a sink node $t$ is equal to the minimum value of the cut separating $u$ and $v$. There are several formulations of this problem:


 * 1) Linear programming formulation
 * 2) Graph theory formulation
 * 3) Network coding formulation
 * 4) Algorithmic formulation