, Volume 31, Issue 3, pp 227–233 | Cite as

A deficit scaling algorithm for the minimum flow problem

  • Laura Ciupală


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.


Network flow network algorithms minimum flow problem scaling technique 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Ahuja R, Magnanti T, Orlin J 1993Network flows. Theory, algorithms and applications (Englewood Cliffs, NJ: Prentice Hall)Google Scholar
  2. Bang-Jensen J, Gutin G 2001Digraphs: Theory, algorithms and applications (London: Springer-Verlag)MATHGoogle Scholar
  3. Ciupală L, Ciurea E 2001 An approach to the minimum flow problem.Fifth Int. Symp. of Economic Informatics, pp 786–790Google Scholar
  4. Ciupală L, Ciurea E 2003 An algorithm for the minimum flow problem.Sixth Int. Conf. of Economic Informatics, pp 565–569Google Scholar
  5. Ciurea E, Ciupală L 2001 Algorithms for minimum flows.Comput. Sci. J. Moldova 9: 275–290MATHMathSciNetGoogle Scholar
  6. Ciurea E, Ciupală L 2004 Sequential and parallel algorithms for minimum flows.J. Appl. Math. Comput. 15: 53–78MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Indian Academy of Sciences 2006

Authors and Affiliations

  • Laura Ciupală
    • 1
  1. 1.Department of Computer Science, Faculty of Mathematics & InformaticsTransilvania University of BraşovRomania

Personalised recommendations