Analysis of preflow push algorithms for maximum network flow

  • J. Cheriyan
  • S. N. Maheshwari
Session 2 Algorithms

DOI: 10.1007/3-540-50517-2_69

Part of the Lecture Notes in Computer Science book series (LNCS, volume 338)
Cite this paper as:
Cheriyan J., Maheshwari S.N. (1988) Analysis of preflow push algorithms for maximum network flow. In: Nori K.V., Kumar S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1988. Lecture Notes in Computer Science, vol 338. Springer, Berlin, Heidelberg


We study the class of preflow push algorithms recently introduced by Goldberg and Tarjan for solving the maximum network flow problem on a weighted digraph G(V,E). We improve Goldberg and Tarjanis O(n3) time bound for the maximum distance preflow push algorithm to O(n2√m) and show that this bound is tight by constructing a parametrized worst case network. We then develop the maximal excess preflow push algorithm and show that it achieves a bound of O(n2√m) pushes. Based on this we develop a maximum network flow algorithm for the synchronous distributed model of computation that uses at most O(n2√m) messages and O(n2) time, thereby improving upon the best previously known algorithms for this model.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1988

Authors and Affiliations

  • J. Cheriyan
    • 1
  • S. N. Maheshwari
    • 2
  1. 1.Computer Science GroupTata Institute of Fundamental Research ColabaBombayIndia
  2. 2.Department of Computer Science and EngineeringIndian Institute of TechnologyNew DelhiIndia

Personalised recommendations