A new approach to the maximum flow problem
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
An O(n2 log n) parallel max-flow algorithm
Journal of Algorithms
A data structure for dynamic trees
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A unified approach to models of synchronous parallel machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
An o(nm log n) algorithm for maximum network flow
An o(nm log n) algorithm for maximum network flow
Graph Theory With Applications
Graph Theory With Applications
Faster shortest-path algorithms for planar graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Max-flow problem in undirected planar networks with node capacities being in NC
Journal of Computer Science and Technology
Improved algorithms for min cut and max flow in undirected planar graphs
Proceedings of the forty-third annual ACM symposium on Theory of computing
| Hi-index | 0.01 |
Algorithms are given that compute maximum flows in planar directed networks either in O((log n)3) parallel time using O(n4) processors or O((log n)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((log n)2) time using O(n3) processors. No efficient parallel algorithm is known for the maximum flow problem in general networks.