Graph algorithms on a tree-structured parallel computer
- 1 September 1984
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 24 (3) , 333-340
- https://doi.org/10.1007/bf02136031
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Efficient parallel algorithms for some graph problemsCommunications of the ACM, 1982
- Parallel algorithms for the connected components and minimal spanning tree problemsInformation Processing Letters, 1982
- Graph problems on a mesh-connected processor array (Preliminary Version)Published by Association for Computing Machinery (ACM) ,1982
- Fast, Efficient Parallel Algorithms for Some Graph ProblemsSIAM Journal on Computing, 1981
- Parallel Matrix and Graph AlgorithmsSIAM Journal on Computing, 1981
- Finding Connected Components and Connected Ones on a Mesh-Connected Parallel ComputerSIAM Journal on Computing, 1980
- A parallel algorithm for constructing minimum spanning treesJournal of Algorithms, 1980
- The Structure of Parallel AlgorithmsPublished by Elsevier ,1980
- Computing connected components on parallel computersCommunications of the ACM, 1979