Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
- 31 December 1993
- journal article
- Published by Elsevier BV in Journal of Computer and System Sciences
- Vol. 47 (3), 459-500
- https://doi.org/10.1016/0022-0000(93)90042-u
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Improved algorithms for graph four- connectivityJournal of Computer and System Sciences, 1991
- Deterministic parallel list rankingAlgorithmica, 1991
- Parallel Depth-First Search in General Directed GraphsSIAM Journal on Computing, 1990
- A simple parallel tree contraction algorithmJournal of Algorithms, 1989
- Cascading Divide-and-Conquer: A Technique for Designing Parallel AlgorithmsSIAM Journal on Computing, 1989
- Faster optimal parallel prefix sums and list rankingInformation and Computation, 1989
- The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic timeAlgorithmica, 1988
- A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar GraphsSIAM Journal on Computing, 1988
- A random 1-011-011-01algorithm for depth first searchCombinatorica, 1988
- Parallel algorithms for planar graph isomorphism and related problemsIEEE Transactions on Circuits and Systems, 1988