Practical parallel algorithms for minimum spanning trees
Authors:
- F. DehneFDF. Dehne
- S. GotzSGS. Gotz
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 366-371
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Randomized parallel list ranking for distributed memory multiprocessorsInternational Journal of Parallel Programming, 1997
- A randomized linear work EREW PRAM algorithm to find a minimum spanning forestLecture Notes in Computer Science, 1997
- Efficient parallel graph algorithms for coarse grained multicomputers and BSP1997
- LogPCommunications of the ACM, 1996
- A Parallel Algorithm for Computing Minimum Spanning TreesJournal of Algorithms, 1995
- A randomized linear-time algorithm to find minimum spanning treesJournal of the ACM, 1995
- A bridging model for parallel computationCommunications of the ACM, 1990
- Minimal spanning trees: An empirical investigation of parallel algorithmsParallel Computing, 1989
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Efficient parallel algorithms for some graph problemsCommunications of the ACM, 1982