A parallel algorithm for finding a blocking flow in an acyclic network (Q1263969)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A parallel algorithm for finding a blocking flow in an acyclic network |
scientific article; zbMATH DE number 4128380
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel algorithm for finding a blocking flow in an acyclic network |
scientific article; zbMATH DE number 4128380 |
Statements
A parallel algorithm for finding a blocking flow in an acyclic network (English)
0 references
1989
0 references
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.
0 references
parallel computing
0 references
network flows
0 references
minimum cost flow problem
0 references
EREW PRAM
0 references
