Abstract
We propose a self-stabilizing distributed algorithm for the minimal global powerful alliance set problem in an arbitrary graph. Then, we give self-stabilizing algorithms for some generalizations of the problem. Using an unfair distributed scheduler, the proposed algorithms converge in O(mn) moves starting from an arbitrary state.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have