334 search results - page 39 / 67 » Practical Parallel Algorithms for Minimum Spanning Trees |
178
click to vote
STOC
1995
ACM
15 years 10 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
175
click to vote
DAC
1989
ACM
15 years 10 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
154
click to vote
JDA
2007
15 years 6 months ago
2007
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
170
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
143
click to vote
JPDC
2006
15 years 6 months ago
2006
A fully unsafe hypercube according to the global safety can be split into a unique set of maximal safe subcubes. Multicasting in a maximal safe subcube can be completed reliably b...