The maximum flow problem: A real-time approach

Parallel Computing

Volumn 29, Issue 6, 2003, Pages 767-794

  Nagy, Naya ^a   Akl, Selim G ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

Accuracy ratio; Asymptotic improvement in quality; Cumulative error; Maximum flow; Module allocation; Parallelism; Real time computation; Reconfigurable multiple bus machine

Indexed keywords

APPROXIMATION THEORY; COMMUNICATION SYSTEMS; MATHEMATICAL MODELS; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; PROGRAM PROCESSORS;

REAL-TIME COMPUTATIONS;

REAL TIME SYSTEMS;

EID: 0038147172     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(03)00022-X     Document Type: Article

References (21)

1. S.G. Akl, Nonlinearity, maximization and parallel real-time computation, in: Proceedings of the 12th Conference on Parallel and Distributed Computing and Systems, Las Vegas, NV, November 2000, pp. 31-36.
2. S.G. Akl, Parallel real-time computation: sometimes quantity means quality, in: Proceedings of the International Symposium on Parallel Architectures, Dallas, TX, December 2000, pp. 2-11.
3. Akl S.G., Bruda S.D. Parallel real-time optimization: beyond speedup. Parallel Processing Letters. 9:1999;499-509.
4. S.D. Bruda, S.G. Akl, On the data-accumulating paradigm, in: Proceedings of the Fourth International Conference on Computer Science and Informatics, Research Triangle Park, NC, October 1998, pp. 150-153.
5. S.D. Bruda, S.G. Akl, Real-time computation: a formal definition and its applications, Technical Report no. 2000-435, Department of Computing and Information Science, Queen's University, Kingston, Ont., 2000.
6. Edmonds J., Karp R.M. Theoretical improvements in algorithmic efficiency for network flow problems. Guy R.K., Hanani H., Sauer N., Schonheim J. Proceedings of the Calgary International Conference on Combinatorial Structures and their Applications. 1970;93-96 Gordon and Breach, New York.
7. Ford L.R., Fulkerson D.R. Maximal flow through a network. Canadian Journal of Mathematics. 8:1956;399-404.
8. Gabow H.N. Scaling algorithms for network problems. Journal of Computer and System Sciences. 31(2):1985;148-168.
9. 2V) algorithm for the maximum flow problem Journal of Computer and System Sciences. 21:1980;203-217.
10. A.V. Goldberg, Recent developments in maximum flow algorithms, Technical Report no. 98-045, NEC Research Institute, Inc., April 1998.
11. Goldberg A.V., Rao S. Beyond the flow decomposition barrier. Journal of the ACM. 45(5):1998;783-797.
12. Goldberg A.V., Tarjan R.E. A new approach to the maximum-flow-problem. Journal of the ACM. 35(4):1988;921-940.
13. Goldberg A.V., Tarjan R.E. A parallel algorithm for finding a blocking flow in an acyclic network. Parallel Processing Letters. 31:1989;265-271.
14. A.V. Karzanov, Determining the maximal flow in a network by the method of preflows, DOKLADY: Russian Academy of Sciences Doklady, Mathematics (formerly Soviet Mathematics-Doklady), 15, 1974.
15. King V., Rao S., Tarjan R.E. A faster deterministic maximum flow algorithm. Journal of Algorithms. 17(3):1994;447-474.
16. M. Nagy, S.G. Akl, Real-time minimum vertex cover for two-terminal series-parallel graphs, Technical Report no. 2000-441, Department of Computing and Information Science, Queen's University, Kingston, Ont., 2000, 18 pp.
17. 2logn) parallel MAX-FLOW algorithm Journal of Algorithms. 3(2):1982;128-146.
18. Stone H.S. Multiprocessor scheduling with the aid of network flow algorithms. IEEE Transactions on Software Engineering. 3(1):1977;85-93.
19. Trahan J.L., Vaidyanathan R., Subbaraman C.P. Constant time graph algorithms on the reconfigurable multiple bus machine. Journal of Parallel and Distributed Computing. 46(1):1997;1-14.
20. Trahan J.L., Vaidyanathan R., Thiruchelvan R.K. On the power of segmenting and fusing buses. Journal of Parallel and Distributed Computing. 34(1):1996;82-94.
21. Vishkin U. A parallel blocking flow algorithm for acyclic networks. Journal of Algorithms. 13:1992;489-501.