A parallel algorithm for finding a blocking flow in an acyclic network (Q1263969)

In this well written and interesting paper a simple parallel algorithm is proposed for finding a blocking flow in an acyclic network. The algorithm is based on moving atomic flows through the network until a blocking flow is achieved, which is a situation where for every vertex except for the source and the sink the total incoming flow equal the total outgoing flow. On an n-vertex m-arc network the algorithm runs in O(n log n) time and O(nm) space on an m-processor EREW PRAM. It is not know whether this can be improved significantly.