Parallel nested dissection for path algebra computations
Operations Research Letters
| Hi-index | 0.00 |
Algorithms are given that compute maximum flows in planar directed networks either in O((logn)3) parallel time using O(n4) processors or O((logn)2) parallel time using O(n6) processors. The resource consumption of these algorithms is dominated by the cost of finding the value of a maximum flow. When such a value is given, or when the computation is on an undirected network, the bound is O((logn)2) time using O(n4) processors. No efficient parallel algorithm is known for the maximum flow problem in general networks.