A distributed algorithm for the maximum flow problem

ISPDC 2005: 4th International Symposium on Parallel and Distributed Computing

Volumn 2005, Issue , 2005, Pages 131-138

  Pham, Thuy Lien ^a   Lavallee, Ivan ^a   Bui, Marc ^a   Do, Si Hoang ^a  

^a UNIVERSITÉ PARIS 8   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA FLOW ANALYSIS; GRAPH THEORY; PARALLEL ALGORITHMS; PROBLEM SOLVING;

ARC CAPACITIES; DYNAMIC CHANGES; FLOW PROBLEM; TIME COMPLEXITY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33847722677     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPDC.2005.4     Document Type: Conference Paper

References (20)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung. Network information flow. IEEE Trans. on Information Theory, 46:1204-1216, 2000.
2. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows - Theory, Algorithms and Applications. Prentice-Hall, Inc. USA, 1993.
3. R. J. Anderson and J. C. Setubal. On the parallel implementation of goldberg's maximum flow algorithm. Proc. of the 4th Annual ACM Symp. on Parallel Algorithms and Architectures, pages 168-177, 1992.
4. V. C. Barbosa. An introduction to distributed algorithmes. The MIT Press, 1996.
5. A. Bogdanov, E. Maneva, and S. Riesenfeld. Power-aware base station positioning. Proceedings of IEEE INFOCOM, 2004.
6. J. Cheriyan and T. Hagerup. A randomized maximum flow algorithm. SIAM Journal on Computing, 24:203-226, 1995.
7. J. Cheriyan and K.Mehlhorn. An analysis of the highest-level selection rule in the preflow-push max-flow algorithm. Information Processing Letters, 69:239-242, 1999.
8. B. V. Cherkassky and A. V. Goldberg. On implementing push-relabel method for the maximum flow problem. Algorithmica, 19:390-410, 1997.
9. Dinitz. Algorithm for solution of a problem in networks with power estimation. Soviet Mathematics Doklady, 11:1277-1280, 1970.
10. J. Edmonds and R. M. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of ACM, 19(2):248-264, 1972.
11. L. Ford and D. Fulkerson. Flow in networks. Princeton University Press, Princeton, 1962.
12. H. N. Gabow. Scaling algorithms for network problems. Journal of Computer and System Sciences, 31(2): 148-168, 1985.
13. A. V. Goldberg. Recent developments in maximum flow algorithms. Technical report, NEC Research Institute, Inc., April 1998.
14. A. V. Goldberg and S. Rao. Bayond the flow decomposition barrier. Journal of ACM, 45(5):783-797, 1998.
15. A. V. Goldberg and R. E. Tarjan. A new approach to the maximum flow problem. Journal of ACM, 35(4):921-940, 1988.
16. L. Ivan. Systematic building of a distributed recurive algorithm, example the shortest path algorithm. Acta Mathematica Viêtnamica, 1(20):3-30, 1995.
17. Karzanov. Determining the maximum flow in a network by the method of preflows. Soviet Mathematics Doklady, 15:434-437, 1974.
18. V. King, S. Rao, and R. Tarjan. A faster deterministic maximum flow algorithm. Journal of Algorithms, 17(3):447-474, 1994.
19. N. Nagy and S. G. Akl. The maximum flow problem : A real-time approach. Technical report, Dept. of Computing and Information Sciences Queen's Univ., Canada, 2001.
20. T. Takkula. A preflow-push algorithm that handles online max flow problems in a static asynchronous network (revision 1.18). Technical report, Chalmers University of Technology, Gothenbourg, Sweden, 2001.