BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-88-1228
       ENTRY:: April 24, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: A Parallel Algorithm for Finding a Blocking Flow in an
               Acyclic Network
        TYPE:: Technical Report
      AUTHOR:: Goldberg, A. V.
      AUTHOR:: Tarjan, R. E.
        DATE:: November 1988
       PAGES:: 14
    ABSTRACT:: We propose a simple parallel algorithm for finding a blocking
               flow in an acyclic network. On an n-vertex, m-arc network,
               our algorithm runs in O(n log n) time and O(nm) space using
               an m-processor EREW PRAM. A consequence of our algorithm is
               an O(n2 (log n) log (nC)-time, O(nm)-space, m-processor
               algorithm for the minimum-cost circulation problem, on a
               network with integer arc capacities of magnitude at most C.
       NOTES:: [Adminitrivia V1/Prg/19950424]
         END:: STAN//CS-TR-88-1228