334 search results - page 36 / 67 » Practical Parallel Algorithms for Minimum Spanning Trees |
181
click to vote
EGPGV
2004
Springer
15 years 10 months ago
2004
Springer
We present a new parallel multiresolution volume rendering algorithm for visualizing large data sets. Using the wavelet transform, the raw data is first converted into a multires...
173
click to vote
CPM
2006
Springer
15 years 8 months ago
2006
Springer
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
150
click to vote
ALGORITHMICA
2002
15 years 5 months ago
2002
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
173
click to vote
COMPGEOM
2006
ACM
15 years 8 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
149
click to vote
FSTTCS
2007
Springer
15 years 11 months ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...