616 search results - page 13 / 124 » Minimum Spanning Tree Based Clustering Algorithms |
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...
122
click to vote
IEICET
2011
14 years 6 months ago
2011
In this paper, we study the minimum spanning tree problem for vertex-labeled graphs, where the weights of edges may vary depending on the selection of labels of vertices at both e...
FOCS
1996
IEEE
15 years 3 months ago
1996
IEEE
In thispaper we give a 3-approximationalgorithmfor the problem ojJnding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximationalgorithmfor t...
84
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log2 n) bits and it converges in O(n2 ) round...