672 search results - page 2 / 135 » Lower-stretch spanning trees |
WSS
1997
13 years 6 months ago
1997
We present a distributed protocol for maintaining a maximum flow spanning tree in a network, with a designated node as the root of the tree. This maximum flow spanning tree can be...
EOR
2006
13 years 5 months ago
2006
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. We propose an univesal scheme to design loop-free and superstabilizing protocols for constructing spanning trees optimizing any tree metrics (not only those that are isom...
ISAAC
1998
Springer
13 years 9 months ago
1998
Springer
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
COMBINATORICS
2006
13 years 5 months ago
2006
A spanning tree T in a finite planar connected graph G determines a dual spanning tree T in the dual graph G such that T and T do not intersect. We show that it is not always poss...