A self-stabilizing algorithm for two disjoint minimal dominating sets in an arbitrary graph

In this paper, we present a self-stabilizing algorithm that concurrently finds two disjoint minimal dominating sets in an arbitrary network graph without any isolated node. The worst case convergence time of the algorithm from any arbitrary initial state is <i>O(n</i>^<i>4</i><i>)</i> where <i>n</i> is the number of nodes in the network.