Learn More
The paper discuses new, very efficient augmentation algorithms and theorems related to maximising the flow in single-commodity and multi-commodity networks. For the first time, efficient algorithms with linear average running time O(m) in the size m of the network, are proposed for restoring the maximum flow in single-commodity and multi-commodity networks(More)
A fundamental theorem related to maximizing the flow in a repairable flow network with arbitrary topology has been stated and proved. ‘The flow transmitted through a repairable network with arbitrary topology and a single source and sink can be maximized by (i) determining, all possible flow paths from the start node (the source) to the end node(More)