613 search results - page 9 / 123 » Time Optimal Self-Stabilizing Spanning Tree Algorithms |
HM
2007
Springer
15 years 3 months ago
2007
Springer
For the NP-hard Optimum Communication Spanning Tree (OCST) problem a cost minimizing spanning tree has to be found, where the cost depends on the communication volume between each ...
101
click to vote
OPODIS
2001
14 years 11 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...
ICCNMC
2005
Springer
15 years 3 months 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, ...
64
Voted
SPAA
1998
ACM
15 years 1 months ago
1998
ACM
SODA
1994
ACM
14 years 11 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...