A note on the maximum flow through a network
Elias, P.
Feinstein, A.
Shannon, C.
This paper appears in: Information Theory, IRE Transactions on
Publication Date: December 1956
Volume: 2,
Issue: 4
On page(s): 117-119
ISSN: 0096-1000
Digital Object Identifier: 10.1109/TIT.1956.1056816
Current Version Published: 2003-01-06
Abstract
This note discusses the problem of maximizing the rate of flow from one terminal to another, through a network which consists of a number of branches, each of which has a limited capacity. The main result is a theorem: The maximum possible flow from left to right through a network is equal to the minimum value among all simple cut-sets. This theorem is applied to solve a more general problem, in which a number of input nodes and a number of output nodes are used.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
