334 search results - page 8 / 67 » Practical Parallel Algorithms for Minimum Spanning Trees |
101
click to vote
OPODIS
2001
14 years 11 months ago
2001
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
93
Voted
WDAG
2007
Springer
15 years 3 months ago
2007
Springer
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
STOC
2000
ACM
15 years 1 months ago
2000
ACM
STOC
1994
ACM
15 years 1 months ago
1994
ACM
Givenn points in the Euclideanplane,we considerthe problemof findingthe minimumtree spanninganyk points.The problemis NP-hardand we givean O(logk)-approximationalgorithm. Key Words...
DC
2008
14 years 9 months ago
2008
