. . . . . . . . . . . . . . . . . . . . . "A Parallel Algorithm for Finding a Blocking Flow in an Acyclic Network" . "A parallel algorithm for finding a blocking flow in an acyclic network"@en . "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 0(n log n) time and 0(nm) space using an m-processor EREW PRAM. A consequence of our algorithm is an 0(n²(log n)log(n(ʹ))-time, 0(nm)-space, m-processor algorithm for the minimum-cost circulation problem, on a network with integer arc capacities of magnitude at most C."@en . . . . . "A parallel algorithm for finding a blocking flow in an acyclic network" . .