Maximal Flow Through a Network
1956 ◽
Vol 8
◽
pp. 399-404
◽
Keyword(s):
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.”
Keyword(s):
Keyword(s):
2021 ◽
Vol 86
(2)
◽
pp. 39-49
Keyword(s):
2016 ◽
Vol 9
(2)
◽
pp. 573-585
2009 ◽
Vol 327
(3-5)
◽
pp. 604-622
◽
Keyword(s):
Keyword(s):