Engineering an external memory minimum spanning tree algorithm

IFIP Advances in Information and Communication Technology

Volumn 155, Issue , 2004, Pages 195-207

  Dementiev, Roman ^a   Sanders, Peter ^a   Schultes, Dominik ^a   Sibeyn, Jop ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

Author keywords

External graph algorithm; External priority queue; Random permutation; Secondary memory; Time forward processing

Indexed keywords

INFORMATION TECHNOLOGY;

EXTERNAL GRAPHS; EXTERNAL MEMORY; EXTERNAL MEMORY ALGORITHMS; INTERNAL ALGORITHMS; MINIMUM SPANNING TREES; PRIORITY QUEUES; RANDOM PERMUTATIONS; SECONDARY MEMORY;

TREES (MATHEMATICS);

EID: 84901051055     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: 10.1007/1-4020-8141-3_17     Document Type: Conference Paper

References (24)

1. J. Abello, A. Buchsbaum, and J. Westbrook. A functional approach to external graph algorithms. Algorithmica, 32(3):437-458, 2002.
2. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31(9): 1116-1127, 1988.
3. L. Arge, G. Brodal, and L. Toma. On external memory MST, SSSP and multi-way planar graph separation. In 7th Scandinavian Workshop on Algorithm Theory, volume 1851 of LNCS, pages 433-447. Springer, 2000.
4. O. Boruvka. O jistém problému minimálním. Pràce, Moravské Prirodovedecké Spolecnosti, pages 1-58, 1926.
5. Gerth Stølting Brodal and Jyrki Katajainen. Worst-case efficient external-memory priority queues. In 6th Scandinavian Workshop on Algorithm Theory, number 1432 in LNCS, pages 107-118. Springer Verlag, Berlin, 1998.
6. Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, and J. S. Vitter. External-memory graph algorithms. In Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 139-149, 1995.
7. R. Dementiev and P. Sanders. Asynchronous parallel disk sorting. In 15th ACM Symposium on Parallelism in Algorithms and Architectures, pages 138-148, San Diego, 2003.
8. R. Dementiev, P. Sanders, D. Schultes, and J. Sibeyn. Engineering an external memory minimum spanning tree algorithm-full paper. http://www.mpi-sb.mpg.de/ ~sanders/papers/emstfull.ps.gz, 2004.
9. V. Jarník. O jistém problému minimálním. Práca Moravské Přirodovědecké Společnosti, 6:57-63, 1930. In Czech.
10. D. Karger, P. N. Klein, and R. E. Tarjan. A randomized linear-time algorithm for finding minimum spanning trees. J. Assoc. Comput. Mach., 42:321-329, 1995.
11. I. Katriel, P. Sanders, and J. L. Träff. A practical minimum spanning tree algorithm using the cycle property. In 11th European Symposium on Algorithms (ESA), number 2832 in LNCS, pages 679-690. Springer, 2003.
12. D. E. Knuth. The Art of Computer Programming-Seminumerical Algorithms, volume 2. Addison Wesley, 2nd edition, 1981.
13. K. Mehlhorn and S. Näher. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999.
14. U. Meyer, P. Sanders, and J. Sibeyn, editors. Algorithms for Memory Hierarchies, volume 2625 of LNCS Tutorial. Springer, 2003.
15. B.M.E. Moret and H.D. Shapiro. An empirical assessment of algorithms for constructing a minimum spanning tree. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 15:99-117, 1994.
16. M. Naor and O. Reingold. On the construction of pseudorandom permutations: Luby-Rackoff revisited. Journal of Cryptology: the journal of the International Association for Cryptologic Research, 12(1):29-66, 1999.
17. J. Nešetřil, H. Milková, and H. Nešetřilová. Otakar boruvka on minimum spanning tree problem: Translation of both the 1926 papers, comments, history. DMATH: Discrete Mathematics, 233, 2001.
18. R. C. Prim. Shortest connection networks and some generalizations. Bell Systems Technical Journal, pages 1389-1401, November 1957.
19. P. Sanders. Random permutations on distributed, external and hierarchical memory. Information Processing Letters, 67(6):305-310, 1998.
20. P. Sanders. Fast priority queues for cached memory. In ALENEX '99, Workshop on Algorithm Engineering and Experimentation, number 1619 in LNCS, pages 312-327. Springer, 1999.
21. D. Schultes. External memory minimum spanning trees. Bachelor thesis, Max-Planck-Institut f. Informatik and Saarland University, http://www.dominik-schultes.de/ emmst/, August 2003.
22. J. F. Sibeyn. External connected components. In 12th Scandinavian Workshop on Algorithm Theory, Springer LNCS, 2004. to appear.
23. D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. Journal of Computer and System Sciences, 26(3):362-391, 1983.
24. R. E. Tarjan. Efficiency of a good but not linear set merging algorithm. Journal of the ACM, 22:215-225, 1975.