Maximal Flow Through a Network
L. R. Ford, Delbert R. Fulkerson · Canadian Journal of Mathematics · 1956
Introduction. 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 2,410 works. doi:10.4153/cjm-1956-045-5 Open-access PDF