Parallel graph algorithms for hypercube computers
- 1 February 1990
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 13 (2) , 143-158
- https://doi.org/10.1016/0167-8191(90)90143-w
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM modelIEEE Transactions on Circuits and Systems, 1988
- New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAMIEEE Transactions on Computers, 1987
- Optimal Graph Algorithms on a Fixed-Size Linear ArrayIEEE Transactions on Computers, 1987
- Data Movement Techniques for the Pyramid ComputerSIAM Journal on Computing, 1987
- Graph Problems on a Mesh-Connected Processor ArrayJournal of the ACM, 1984
- 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
- An n2 algorithm for determining the bridges of a graphInformation Processing Letters, 1971
- A note on two problems in connexion with graphsNumerische Mathematik, 1959