396 search results - page 14 / 80 » An Optimal Minimum Spanning Tree Algorithm |
EGH
2009
Springer
13 years 5 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...
ESA
2005
Springer
14 years 25 days ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
COMPGEOM
2000
ACM
13 years 11 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...
ICALP
2001
Springer
13 years 12 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 ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...