Efficient parallel algorithms for graph problems
- 1 June 1990
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 5 (1-4) , 43-64
- https://doi.org/10.1007/bf01840376
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Approximate and exact parallel scheduling with applications to list, tree and graph problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithmsPublished by Association for Computing Machinery (ACM) ,1986
- The power of parallel prefixIEEE Transactions on Computers, 1985
- Solving tree problems on a mesh-connected processor arrayPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Parallel tree contraction and its applicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Randomized speed-ups in parallel computationPublished by Association for Computing Machinery (ACM) ,1984
- Finding biconnected componemts and computing tree functions in logarithmic parallel timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- UltracomputersACM Transactions on Programming Languages and Systems, 1980
- Parallel Prefix ComputationJournal of the ACM, 1980
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976