ON THE MAX FLOW MIN CUT THEOREM OF NETWORKS
RAND CORP SANTA MONICA CA
Pagination or Media Count:
It is shown that Mengers theorem and the Max Flow Min Cut Theorem on networks are applications of the duality theorem of linear inequality theory.
- Numerical Mathematics