Abstract
In this paper, we develop a new preflow algorithm for the minimum flow problem, called deficit scaling algorithm. This is a special implementation of the generic preflow algorithm for the minimum flow problem developed by Ciurea and Ciupală earlier. The bottleneck operation in the generic preflow algorithm is the number of noncancelling pulls. Using the scaling technique (i.e. selecting the active nodes with sufficiently large deficits), we reduce the number of noncancelling pulls to O(n 2 log-c) and obtain an O(nm +n 2 log-c) algorithm.
Similar content being viewed by others
References
Ahuja R, Magnanti T, Orlin J 1993Network flows. Theory, algorithms and applications (Englewood Cliffs, NJ: Prentice Hall)
Bang-Jensen J, Gutin G 2001Digraphs: Theory, algorithms and applications (London: Springer-Verlag)
Ciupală L, Ciurea E 2001 An approach to the minimum flow problem.Fifth Int. Symp. of Economic Informatics, pp 786–790
Ciupală L, Ciurea E 2003 An algorithm for the minimum flow problem.Sixth Int. Conf. of Economic Informatics, pp 565–569
Ciurea E, Ciupală L 2001 Algorithms for minimum flows.Comput. Sci. J. Moldova 9: 275–290
Ciurea E, Ciupală L 2004 Sequential and parallel algorithms for minimum flows.J. Appl. Math. Comput. 15: 53–78
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ciupală, L. A deficit scaling algorithm for the minimum flow problem. Sadhana 31, 227–233 (2006). https://doi.org/10.1007/BF02703378
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02703378