A parallel algorithm for computing minimum spanning trees
- 1 June 1992
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 363-372
- https://doi.org/10.1145/140901.141917
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Improved nonconservative sequential and parallel integer sortingInformation Processing Letters, 1990
- Efficient parallel algorithms for graph problemsAlgorithmica, 1990
- Efficient implementation of graph algorithms using contractionJournal of the ACM, 1989
- An optimally efficient selection algorithmInformation Processing Letters, 1988
- On efficient parallel strong orientationInformation Processing Letters, 1985
- A parallel median algorithmInformation Processing Letters, 1985
- Implementation of simultaneous memory address access in models that forbid itJournal of Algorithms, 1983
- Efficient parallel algorithms for some graph problemsCommunications of the ACM, 1982
- A parallel algorithm for constructing minimum spanning treesJournal of Algorithms, 1980
- Computing connected components on parallel computersCommunications of the ACM, 1979