22 search results - page 2 / 5 » Engineering an External Memory Minimum Spanning Tree Algorit... |
ESA
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We present a software library Stxxl, that enables practiceoriented experimentation with huge data sets. Stxxl is an implementation of the C++ standard template library ST...
FSTTCS
2001
Springer
13 years 9 months ago
2001
Springer
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...
CGF
2000
13 years 4 months ago
2000
In this paper, we propose a novel external-memory algorithm to support view-dependent simplification for datasets much larger than main memory. In the preprocessing phase, we use ...
COCOON
1999
Springer
13 years 9 months ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...