396 search results - page 12 / 80 » An Optimal Minimum Spanning Tree Algorithm |
ICPADS
2007
IEEE
14 years 1 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...
WEA
2010
Springer
14 years 2 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 ...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
SODA
2003
ACM
13 years 8 months ago
2003
ACM
JUCS
2007
13 years 7 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...