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.

Preview

PDF - Requires a PDF viewer
1681Kb

Official URL: http://nz.cosc.canterbury.ac.nz/tad.takaoka/alg/graphalg/mf.txt

Abstract

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
Keywords:	Maximum flow, flow networks, flow potential, reference node, refernece potential, MPM algorithm, 3 Indians' algorithm
ID Code:	160
Deposited By:	utas eprints
Deposited On:	10 Mar 2005
Last Modified:	18 Jul 2008 19:38
ePrint Statistics:	View statistics for this ePrint

Repository Staff Only: item control page