140 search results - page 2 / 28 » Computing Minimum Spanning Trees with Uncertainty |
117
click to vote
CORR
2006
Springer
15 years 1 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 ...
130
click to vote
SAC
2009
ACM
15 years 5 months ago
2009
ACM
During a disaster, emergency response operations can benefit from the establishment of a wireless ad hoc network. We propose the use of autonomous robots that move inside a disas...
118
click to vote
CIAC
2000
Springer
15 years 5 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 ...
ESA
2008
Springer
15 years 2 months ago
2008
Springer
77
Voted
CN
2008
15 years 1 months ago
2008
