Abstract

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 O(n4) where n is the number of nodes in the network.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call