Engineering an External Memory Minimum Spanning Tree Algorithm
- 21 February 2006
- book chapter
- Published by Springer Nature
- p. 195-208
- https://doi.org/10.1007/1-4020-8141-3_17
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- External Connected ComponentsPublished by Springer Nature ,2004
- A Functional Approach to External Graph AlgorithmsAlgorithmica, 2002
- On External-Memory MST, SSSP, and Multi-way Planar Graph SeparationPublished by Springer Nature ,2000
- Fast Priority Queues for Cached MemoryPublished by Springer Nature ,1999
- On the Construction of Pseudorandom Permutations: Luby—Rackoff RevisitedJournal of Cryptology, 1999
- Random permutations on distributed, external and hierarchical memoryInformation Processing Letters, 1998
- A randomized linear-time algorithm to find minimum spanning treesJournal of the ACM, 1995
- An empirical assessment of algorithms for constructing a miminum spanning treePublished by American Mathematical Society (AMS) ,1994
- The input/output complexity of sorting and related problemsCommunications of the ACM, 1988
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957