A self-stabilizing algorithm for the maximum flow problem

Distributed Computing

Volumn 10, Issue 4, 1997, Pages 167-180

  Ghosh, Sukumar ^a   Gupta, Arobinda ^a   Pemmaraju, Sriram V ^a  

^a University of Iowa   (United States)

Author keywords

Distributed algorithms; Fault tolerance; Maximum flow; Self stabilization

Indexed keywords

COMPUTATIONAL METHODS; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING;

GOLDBERG TARJAN ALGORITHM; MAXIMUM FLOW PROBLEM; SELF STABILIZING ALGORITHM;

ALGORITHMS;

EID: 0031210477     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004460050034     Document Type: Article

References (33)

1. Ahuja RK, Magnanti TL, Orlin JB: Some recent advances in network flows. SIAM Rev 33: 175-219 (1991)
2. Anderson R, Sctubal JC: Goldberg's algorithm for maximum flow in perspective: a computational study. DIMACS Series Discrete Math Theoret Comput Sci 12: 1-18 (1988)
3. Awerbuch B: Complexity of network synchronization. J ACM 32: 804-823 (1985)
4. Awerbuch B, Leighton T: A simple local-control approximation algorithm for multicommodity flow. In: Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pp 459-468 (1993)
5. Awerbuch B, Varghese G: Distributed program checking: a paradigm for building self-stabilizing distributed protocols. In: Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, pp 258-267 (1991)
6. Bazaraa MS, Jarvis JJ, Sherali HD: Linear Programming and Network Flows. 2nd edn. Wiley, New York 1990
7. Cheriyan J, Hagerup T, Melhorn K: Can a maximum flow be computed in O(nm) time? In: Proceedings of the International Colloquim on Automata, Languages, and Programming (1990)
8. Collin Z, Dolev S: Self-stabilizing depth-first search. Inf Proc Letters 49: 297-301 (1994)
9. Cormen TH, Leiserson CE, Rivest RL: An Introduction to Algorithms. The MIT Press, Cambridge, MA 1991
10. Dijkstra EW: Self-stabilizing systems in spite of distributed control. Comm ACM 17(11): 643-644 (1974)
11. Dolev S, Israeli A, Moran S: Self-stabilization of dynamic systems assuming only read write atomicity. In: Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, pp 103-118 (1990)
12. Dolev S, Gouda MG, Schneider M: Memory requirements for silent stabilization. Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, pp 27-34 (1996)
13. Edmonds J, Karp RM: Theoretical improvements in algorithmic efficiency for network flow problems. J ACM 19: 248-264 (1972)
14. Ford LR, Fulkerson DW: Maximal flow through a network. Canad J Math 8: 399-404 (1956)
15. Ghosh S, Karaata MM: A self-stabilizing algorithm for coloring planar graphs. Distrib Comput 7(1): 55-59 (1993)
16. Ghosh S, Gupta A: An exercise in fault-containment: self-stabilizing leader election. Inform Process Lett 59(5): 281-288 (1996)
17. Ghosh S, Gupta A, Pemmaraju SV: A self-stabilizing algorithm for the maximum flow problem. Technical Report TR-94-10, Department of Computer Science. The University of Iowa, Iowa City (1995)
18. Ghosh S, Gupta A, Pemmaraju SV: A fault-containing self-stabilizing algorithm for spanning trees. J Comput Inform 2(1): 322-338 (1996)
19. Ghosh S, Gupta A, Pemmaraju SV: Fault-containing network protocols. Proceedings of the ACM Symposium on Applied Computing (1997)
20. Ghosh S, Gupta A, Herman T, Pemmaraju SV: Fault-containing self-stabilizing algorithms. Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, pp 45-54 (1996)
21. Goldberg AV: Efficient graph algorithms for sequential and parallel computers. Technical Report MIT LCS TR-374. Laboratory for Computer Science. Massachussetts Institute of Technology (1987)
22. Goldberg AV, Tarjan RH: A new approach to the maximum flow problem. J ACM 35: 921-940 (1988)
23. Gouda MG, Herman T: Stabilizing unison. Inform Process Lett 35: 171-175 (1990)
24. Gouda MG, Schneider M: Maximum flow routing. In: Proceedings of the 2nd Workshop on Self-stabilizing Systems (1995)
25. Huang A, Chen N: A self-stabilizing algorithm for constructing breadth-first tree. Inform Process Lett 41: 107-117 (1992)
26. Huang ST: Leader election in uniform rings. ACM Trans Prog Lang Sys 15: 563-573 (1993)
27. Israeli A, Jalfon M: Token management schemes and random walks yield self-stabilizing mutual exclusion. In: Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, pp 119-132 (1990)
28. Karaata MH, Pemmaraju SV, Bruell SC, Ghosh S: Self-stabilizing algorithms for finding centers and medians of trees. Technical Report TR-94-03. Department of Computer Science. The University of Iowa. 1994. Abstract appeared in ACM Annual Symposium on Principles of Distributed Computing (1994)
29. Lin X, Ghosh S: Self-stabilizing maxima finding. In: Proceedings of the 28th Annual Allerton Conference, pp 662-671 (1991)
30. Schneider M: Self-stabilization. ACM Comput Surveys 25(1): 45-67 (1993)
31. 2 log n) parallel max-flow algorithm. J Algorithms 3: 128-146 (1982)
32. Tarjan RE: Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA (1983)
33. Yu HP, Chen NS, Huang ST: A self-stabilizing algorithm for constructing spanning trees Inform Process Lett 39: 147-151 (1991)