Abstract
The problem discussed in this paper was formulated by T. Harris as follows:
“Consider a rail network connecting two cities by way of a number of intermediate cities, where each link of the network has a number assigned to it representing its capacity. Assuming a steady state condition, find a maximal flow from one given city to the other.”
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
G. B. Dantzig, Maximization of a linear function of variables subject to linear inequalities: Activity analysis of production and allocation(Cowles Commission, 1951).
H. Whitney, Non-separable and planar graphs, Trans. Amer. Math. Soc, 34(1932), 339-362.
H. Whitney, Planar graphs,Fundamenta Mathematicae, 21(1933), 73-84.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Birkhäuser Boston, a part of Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Ford, L.R., Fulkerson, D.R. (2009). Maximal Flow Through a Network. In: Gessel, I., Rota, GC. (eds) Classic Papers in Combinatorics. Modern Birkhäuser Classics. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4842-8_15
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4842-8_15
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-4841-1
Online ISBN: 978-0-8176-4842-8
eBook Packages: Springer Book Archive