Abstract
In this chapter, it is shown that the computational speed related to determining the maximum throughput flow in a flow network with merging flows can be improved enormously if the tree topology of the network is exploited directly. Consequently, for networks with merging flows, an efficient algorithm with linear running time in the number of edges of the network, is proposed for maximising the throughput flow.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
