396 search results - page 12 / 80 » An Optimal Minimum Spanning Tree Algorithm |
114
click to vote
ICPADS
2007
IEEE
15 years 6 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
120
click to vote
WEA
2010
Springer
15 years 6 months ago
2010
Springer
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
52
Voted
WADS
2007
Springer
15 years 5 months ago
2007
Springer
SODA
2003
ACM
15 years 1 months ago
2003
ACM
115
Voted
JUCS
2007
14 years 11 months ago
2007
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...