Library Open Repository
An O(|V|3) algorithm for finding maximum flows in networks
Malhotra, V and Kumar, MP and Maheshwari, SN (1978) An O(|V|3) algorithm for finding maximum flows in networks. Information Processing Letters, 7 (6). pp. 277-278.
iplFlow.pdf | Download (1MB)
Available under University of Tasmania Standard License.
An O(V cubed) algorithm is given for finding maximum flow in capacitated networks. THe algorithm is already well refenreces in literature and is being posted here to make it accessible to all in electronic form.
|Keywords:||Maximum flow, flow networks, flow potential, reference node, refernece potential, MPM algorithm, 3 Indians' algorithm|
|Journal or Publication Title:||Information Processing Letters|
|Publisher:||Elsevier Science Publishers B.V. (North-Holland)|
|Page Range:||pp. 277-278|
|Date Deposited:||10 Mar 2005|
|Last Modified:||18 Nov 2014 03:10|
|Item Statistics:||View statistics for this item|
Actions (login required)
|Item Control Page|