334 search results - page 13 / 67 » Practical Parallel Algorithms for Minimum Spanning Trees |
65
Voted
EGH
2009
Springer
14 years 7 months ago
2009
Springer
Graphics Processor Units are used for many general purpose processing due to high compute power available on them. Regular, data-parallel algorithms map well to the SIMD architect...
WADS
2005
Springer
15 years 3 months ago
2005
Springer
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...
PODC
1997
ACM
15 years 1 months ago
1997
ACM
COMPGEOM
2000
ACM
15 years 2 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
127
Voted
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...