Analysis of preflow push algorithms for maximum network flow

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 338 LNCS, Issue , 1988, Pages 30-48

  Cheriyan, J ^a   Maheshwari, S N ^b  

^a TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

[No Author keywords available]

Indexed keywords

GOLD; SOFTWARE ENGINEERING;

DISTRIBUTED MODELING; MAXIMUM DISTANCE; MAXIMUM NETWORKS; PREFLOW-PUSH ALGORITHMS; TIME BOUND; WEIGHTED DIGRAPH;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84964057826     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-50517-2_69     Document Type: Conference Paper

References (8)

1. B. Awerbuch, “Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization”, Networks 15(1985), 425-437.
2. B.V. Cherkasky, “Algorithm of construction of maximal flow in networks with complexity of O(V2√E) operations”, Mathematical Methods of Solution of Economical Problems 7(1977), 112.
3. E.A. Dinic, “'Algorithm for solution of a problem of maximum flow in networks with power estimation”, Soviet Math. Doklady 11(1980), 1277-1280.
4. 2/3) algorithm for the maximal flow problem”, Acta Informatica 14(1980), 221-242.
5. Z. Galil, “On the theoretical efficiency of various network flow algorithms”, Theoretical Computer Science 14(1981) 103-111.
6. A.V. Goldberg, “Efficient graph algorithms for sequential and parallel computers”, Ph.D. Thesis, MIT/LCS/TR-374, Feb 1987.
7. A.V. Goldberg and R.E. Tarjan, “A new approach to the maximum flow problem”, Proc. 18th Annual ACM Symp. on Theory of Computing (1986).
8. 1/2) distributed max-flow algorithm”, Proc. International Conference on Parallel Processing, 1887.