166 search results - page 1 / 34 » A fast distributed approximation algorithm for minimum spann... |
221
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
226
Voted
OPODIS
2001
15 years 9 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...
207
Voted
CIAC
2000
Springer
15 years 12 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...