Self-stabilizing algorithms for minimal global powerful alliance sets in graphs

Saïd Yahiaoui (1) , Yacine Belhoul (1) , Mohammed Haddad (1) , Hamamache Kheddouci (1)

1 GrAMA - Graphes, Algorithmes et Multi-Agents

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.

Domaines: Informatique [cs]

Saïd Yahiaoui, Yacine Belhoul, Mohammed Haddad, Hamamache Kheddouci. Self-stabilizing algorithms for minimal global powerful alliance sets in graphs. Information Processing Letters, 2013, 10–11, 113, pp.365-370. ⟨10.1016/j.ipl.2013.03.001⟩. ⟨hal-01339164⟩