A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Loop-free super-stabilizing spanning tree construction
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing minimum degree spanning tree within one from the optimal degree
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
We propose a self-stabilizing algorithm for constructing a Minimum-Degree Spanning Tree (MDST) in undirected networks. Starting from an arbitrary state, our algorithm is guaranteed to converge to a legitimate state describing a spanning tree whose maximum node degree is at most Δ*+ 1, where Δ* is the minimum possible maximum degree of a spanning tree of the network. To the best of our knowledge our algorithm is the first self-stabilizing solution for the construction of a minimum-degree spanning tree in undirected graphs. The algorithm uses only local communications (nodes interact only with the neighbors at one hop distance). Moreover, the algorithm is designed to work in any asynchronous message passing network with reliable FIFO channels. Additionally, we use a fine grained atomicity model (i.e. the send/receive atomicity). The time complexity of our solution is O(mn2 log n) where m is the number of edges and n is the number of nodes. The memory complexity is O(δ log n) in the send-receive atomicity model (δ is the maximal degree of the network).