Two minimum spanning forest algorithms on fixed-size hypercube computers
- 1 September 1990
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 15 (1) , 179-187
- https://doi.org/10.1016/0167-8191(90)90041-7
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Parallel graph algorithms for hypercube computersParallel Computing, 1990
- 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 algorithms for the connected components and minimal spanning tree problemsInformation Processing Letters, 1982
- A parallel algorithm for constructing minimum spanning treesJournal of Algorithms, 1980
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957