On the Max Flow Min Cut Theorem of Networks.
暂无分享,去创建一个
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.
暂无分享,去创建一个