Maximal Flow Through a Network
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.”
KeywordsPlanar Graph Maximal Flow Original Network Rail Network Capacity Problem
Unable to display preview. Download preview PDF.