Open Access Repository

An O(|V|3) algorithm for finding maximum flows in networks


Downloads per month over past year

Malhotra, V, Kumar, MP and Maheshwari, SN 1978 , 'An O(|V|3) algorithm for finding maximum flows in networks' , Information Processing Letters, vol. 7, no. 6 , pp. 277-278 .

iplFlow.pdf | Download (1MB)
Available under University of Tasmania Standard License.

| Preview


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.

Item Type: Article
Authors/Creators:Malhotra, V and Kumar, MP and Maheshwari, SN
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)
Item Statistics: View statistics for this item

Actions (login required)

Item Control Page Item Control Page