A new parallel algorithm for network flow problems

  • I-Ngo Chen
Session 8: Computation Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 24)


  1. [1]
    Y.K. Chen and Tse-Yun Feng, "A Parallel Algorithm for Maximum Flow Problem", Proceedings of the 1973 Sagamore Computer Conference.Google Scholar
  2. [2]
    E.W. Dijkstra, "A Note on Two Problems in Connection with Graphs", Numerische Mathematik I (1959), pp. 269–271.Google Scholar
  3. [3]
    M. Pollack, "The Maximum Capacity through a Network", OR 8(1960), pp. 733–736.Google Scholar
  4. [4]
    I.N. Chen, "A Fast Method for Minimum Cost Flows", Tech. Rep. TR74-15, Dept. of Computing Science, University of Alberta, (August 1974).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • I-Ngo Chen
    • 1
  1. 1.Department of Computing ScienceUniversity of AlbertaEdmontonCanada

Personalised recommendations