53 search results - page 1 / 11 » Spanning Tree Construction for Nameless Networks |
WDAG
1990
Springer
13 years 9 months ago
1990
Springer
SIAMCOMP
2000
13 years 5 months ago
2000
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
WDAG
2001
Springer
13 years 10 months ago
2001
Springer
Self-stabilizing algorithms for constructing a spanning tree of an arbitrary network have been studied for many models of distributed networks including those that communicate via ...
PPSN
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
ALGOSENSORS
2009
Springer
13 years 3 months ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...