litlas
Log inCreate account

12. On the Max-Flow Min-Cut Theorem of Networks

Authors: George B. Dantzig, D. R. Fulkerson - Princeton University Press eBooks 1957 cited by 172

Abstract : It is shown that Menger's theorem and the Max Flow Min Cut Theorem on networks are applications of the duality theorem of linear inequality theory.

12. On the Max-Flow Min-Cut Theorem of Networks | Litlas