Planar Depth-First Search in $O(\log n)$ Parallel Time
- 1 August 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 19 (4) , 678-704
- https://doi.org/10.1137/0219047
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Some improved parallelisms for graphsPublished by Springer Nature ,2005
- Optimal parallel algorithms on planar graphsInformation and Computation, 1990
- Faster optimal parallel prefix sums and list rankingInformation and Computation, 1989
- On saving space in parallel computationInformation Processing Letters, 1988
- Parallel Symmetry-Breaking in Sparse GraphsSIAM Journal on Discrete Mathematics, 1988
- A linear-processor algorithm for depth-first search in planar graphsInformation Processing Letters, 1988
- A random 1-011-011-01algorithm for depth first searchCombinatorica, 1988
- Parallel Algorithms for Depth-First Searches I. Planar GraphsSIAM Journal on Computing, 1986
- Depth-first search is inherently sequentialInformation Processing Letters, 1985
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985