616 search results - page 12 / 124 » Minimum Spanning Tree Based Clustering Algorithms |
162
Voted
SOFSEM
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
196
Voted
ICPADS
2007
IEEE
16 years 20 days 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...
198
Voted
WEA
2010
Springer
16 years 1 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 ...
99
Voted
WADS
2007
Springer
16 years 14 days ago
2007
Springer