396 search results - page 11 / 80 » An Optimal Minimum Spanning Tree Algorithm |
ICCNMC
2005
Springer
14 years 27 days ago
2005
Springer
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
ESA
1998
Springer
13 years 11 months ago
1998
Springer
WDAG
2001
Springer
13 years 11 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 ...
EOR
2006
13 years 7 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...
INFOCOM
2003
IEEE
14 years 20 days ago
2003
IEEE
— In this paper, we present a Minimum Spanning Tree (MST) based topology control algorithm, called Local Minimum Spanning Tree (LMST), for wireless multi-hop networks. In this al...