Maximal Flow Through a Network
L. R. Ford, Delbert R. Fulkerson · Birkhäuser Boston eBooks · 2009
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.”
Cited by 1,829 works. doi:10.1007/978-0-8176-4842-8_15