Maximal Flow Through a Network

  • L. R. FordJr.
  • D. R. Fulkerson
Part of the Modern Birkhäuser Classics book series (MBC)


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.”


Planar Graph Maximal Flow Original Network Rail Network Capacity Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    G. B. Dantzig, Maximization of a linear function of variables subject to linear inequalities: Activity analysis of production and allocation(Cowles Commission, 1951).Google Scholar
  2. 2.
    H. Whitney, Non-separable and planar graphs, Trans. Amer. Math. Soc, 34(1932), 339-362.MathSciNetGoogle Scholar
  3. 3.
    H. Whitney, Planar graphs,Fundamenta Mathematicae, 21(1933), 73-84.Google Scholar

Copyright information

© Birkhäuser Boston, a part of Springer Science+Business Media, LLC 2009

Authors and Affiliations

  • L. R. FordJr.
    • 1
  • D. R. Fulkerson
    • 1
  1. 1.Rand CorporationSanti MonicaUSA

Personalised recommendations