Roman Dementiev, Peter Sanders, Dominik Schultes, Jop Sibeyn  Home/Search
Context Related
| mpisb.mpg.de/~sanders/pap...emst.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mpisb.mpg.de/~sanders/pa...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than previously known external memory algorithms for this problem and needs a factor of at least four less I/Os for realistic inputs. (Update)
Cited by: More
Engineering an External Memory Minimum Spanning Tree.. - Dementiev, Sanders.. (2004) (Correct)
Active bibliography (related documents): More All
0.4: Accessing Multiple Sequences Through Set Associative Caches - Sanders (1999) (Correct)
0.3: Fast Priority Queues for Cached Memory - Sanders (1999) (Correct)
0.3: Asynchronous Parallel Disk Sorting - Dementiev, Sanders (2003) (Correct)
Similar documents based on text: More All
0.3: 2003 Penny Sort - Dementiev, Sanders (2003) (Correct)
0.2: Engineering a Sorted List Data Structure for 32 Bit Keys - Dementiev, Kettner.. (Correct)
0.1: Practical Parallel List Ranking - Sibeyn, Guillaume, Seidel (1997) (Correct)
BibTeX entry: (Update)
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. http://citeseer.ist.psu.edu/dementiev04engineering.html More
@misc{ dementiev04engineering,
author = "R. Dementiev and P. Sanders and D. Schultes and J. Sibeyn",
title = "Engineering an external memory minimum spanning tree algorithm --- full
paper",
text = "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.",
year = "2004",
url = "citeseer.ist.psu.edu/dementiev04engineering.html" }
Citations (may not include all citations):375 The LEDA Platform of Combinatorial and Geometric Computing - Mehlhorn, Nher - 1999
183 A data structure for dynamic trees (context) - Sleator, Tarjan - 1983
175 Shortest connection networks and some generalizations (context) - Prim - 1957
119 The Art of Computer Programming --- Seminumerical Algorithms (context) - Knuth - 1981
109 inputoutput complexity sorting and related problem (context) - Vitter, output et al. - 1988
107 External-memory graph algorithms - Chiang, Goodrich et al. - 1995
77 the construction of pseudorandom permutations: LubyRackoff r.. - Naor, Reingold - 1999
33 A functional approach to external graph algorithms - Abello, Buchsbaum et al. - 2002
27 A randomized linear-time algorithm for finding minimum spann.. - Karger, Klein et al. - 1995
19 Fast priority queues for cached memory - Sanders - 1999
13 Information Processing Letters - Sanders, on et al. - 1998
9 Algorithms for Memory Hierarchies (context) - Meyer, Sanders et al. - 2003
7 SSSP and multi-way planar graph separation (context) - Arge, Brodal et al. - 2000
7 An empirical assessment of algorithms for constructing a min.. (context) - Moret, Shapiro - 1994
7 Efficiency of a good but not linear set merging algorithm (context) - Tarjan - 1975
4 Asynchronous parallel disk sorting - Dementiev, Sanders - 2003
3 Worst-case efficient external-memory priority queues (context) - Brodal, Katajainen - 1998
1 External connected components (context) - Sibeyn - 2004
1 Engineering an external memory minimum spanning tree algorit.. - Dementiev, Sanders et al. - 2004
1 Moravsk Prirodovedeck Spolecnosti (context) - Boruvka, problmu et al. - 1926
1 Otakar boruvka on minimum spanning tree problem: Translation.. (context) - set, Milkov et al. - 1926
1 A practical minimum spanning tree algorithm using the cycle .. - Katriel, Sanders et al. - 2003
1 Prca Moravsk Prrodovedeck Spolecnosti (context) - Jarnk, problmu - 1930
1 External memory minimum spanning trees (context) - Schultes - 2003
Documents on the same site (http://www.mpi-sb.mpg.de/~sanders/papers/index.html): More
Better Algorithms for Parallel Backtracking - Sanders (1995) (Correct)
Asynchronous Random Polling Dynamic Load Balancing - Sanders (Correct)
A Parallelization of Dijkstra's Shortest Path Algorithm - Crauser, Mehlhorn, Meyer.. (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC