Self-Stabilizing Algorithms of Constructing Spanning Tree and Weakly Connected Minimal Dominating Set

Authors:
Pradip K. Srimani;Zhenyu Xu
Affiliations:
Clemson University,USA;Clemson University,USA
Venue:
ICDCSW '07 Proceedings of the 27th International Conference on Distributed Computing Systems Workshops
Year:
2007

Citing 0
Cited 2

A self-stabilizing algorithm for constructing weakly connected minimal dominating sets

Information Processing Letters
A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a self-stabilizing algorithm that computes the breadth first spanning tree in arbitrary graph, with O(n3) time complexity using the unfair central daemon. We then propose a self-stabilizing algorithm to compute the weakly connected minimal dominating set in a graph using the same model and provide its correctness and complexity analysis; as far as we know, this is the first self-stabilizing algorithm to compute such sets.