334 search results - page 5 / 67 » Practical Parallel Algorithms for Minimum Spanning Trees |
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
PDPTA
2003
14 years 11 months ago
2003
We investigate the management of flocking mobile objects using a parallel message-passing computer cluster. An octree, a data structure well-known for use in managing a 3D space, ...
ICTAI
2006
IEEE
15 years 3 months ago
2006
IEEE
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorith...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
Given a graph G and a spanning tree T of G, we say that T is a tree t-spanner of G if the distance between every pair of vertices in T is at most t times their distance in G. The p...
ICPADS
2005
IEEE
15 years 3 months ago
2005
IEEE
— The Distributed Spanning Tree (DST) is an overlay structure designed to be scalable. It supports the growth from small scale to large scale. The DST is a tree without bottlenec...