DocumentCode
937935
Title
A note on the maximum flow through a network
Author
Elias, P. ; Feinstein, A. ; Shannon, C.E.
Volume
2
Issue
4
fYear
1956
fDate
12/1/1956 12:00:00 AM
Firstpage
117
Lastpage
119
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.
Keywords
Graph theory; Networks; Bridges; Cities and towns; Communication channels; Delay; Telephony;
fLanguage
English
Journal_Title
Information Theory, IRE Transactions on
Publisher
ieee
ISSN
0096-1000
Type
jour
DOI
10.1109/TIT.1956.1056816
Filename
1056816
Link To Document