Optimal parallel algorithms on planar graphs
- 1 January 1990
- journal article
- Published by Elsevier in Information and Computation
- Vol. 84 (1) , 71-96
- https://doi.org/10.1016/0890-5401(90)90034-f
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Faster optimal parallel prefix sums and list rankingInformation and Computation, 1989
- Optimal Parallel 5-Colouring of Planar GraphsSIAM Journal on Computing, 1989
- On saving space in parallel computationInformation Processing Letters, 1988
- Parallel Symmetry-Breaking in Sparse GraphsSIAM Journal on Discrete Mathematics, 1988
- Relations between Concurrent-Write Models of Parallel ComputationSIAM Journal on Computing, 1988
- Parallel Algorithmic Techniques For Combinational ComputationAnnual Review of Computer Science, 1988
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic TimeSIAM Journal on Computing, 1988
- Deterministic coin tossing with applications to optimal parallel list rankingInformation and Control, 1986
- Efficient parallel algorithms for some graph problemsCommunications of the ACM, 1982
- Computing connected components on parallel computersCommunications of the ACM, 1979