Foundations of Software Technology and Theoretical Computer Science
Volume 338 of the series Lecture Notes in Computer Science pp 3048
Analysis of preflow push algorithms for maximum network flow
 J. CheriyanAffiliated withComputer Science Group, Tata Institute of Fundamental Research Colaba
 , S. N. MaheshwariAffiliated withDepartment of Computer Science and Engineering, Indian Institute of Technology
Abstract
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(n^{3}) time bound for the maximum distance preflow push algorithm to O(n^{2}√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(n^{2}√m) pushes. Based on this we develop a maximum network flow algorithm for the synchronous distributed model of computation that uses at most O(n^{2}√m) messages and O(n^{2}) time, thereby improving upon the best previously known algorithms for this model.
 Title
 Analysis of preflow push algorithms for maximum network flow
 Book Title
 Foundations of Software Technology and Theoretical Computer Science
 Book Subtitle
 Eighth Conference, Pune, India December 21–23, 1988 Proceedings
 Pages
 pp 3048
 Copyright
 1988
 DOI
 10.1007/3540505172_69
 Print ISBN
 9783540505174
 Online ISBN
 9783540460305
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 338
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors
 Authors

 J. Cheriyan ^{(1)}
 S. N. Maheshwari ^{(2)}
 Author Affiliations

 1. Computer Science Group, Tata Institute of Fundamental Research Colaba, 400 005, Bombay, India
 2. Department of Computer Science and Engineering, Indian Institute of Technology, 110 016, New Delhi, India
Continue reading...
To view the rest of this content please follow the download PDF link above.