Optimal parallel algorithms on planar graphs
- 1 June 2005
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic TimeSIAM Journal on Computing, 1988
- Towards optimal parallel bucket sortingInformation and Computation, 1987
- An optimal randomized parallel algorithm for finding connected components in a graphPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Approximate and exact parallel scheduling with applications to list, tree and graph problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Parallel tree contraction and its applicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Relations between concurrent-write models of parallel computationPublished by Association for Computing Machinery (ACM) ,1984
- Efficient parallel algorithms for some graph problemsCommunications of the ACM, 1982
- An O(logn) parallel connectivity algorithmJournal of Algorithms, 1982
- Computing connected components on parallel computersCommunications of the ACM, 1979
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969