Belhoul, YacineYahiaoui, Saïd2013-11-242013-11-242013-050020-0190http://dl.cerist.dz/handle/CERIST/325We 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 stateSelf-stabilizing algorithmsGraph algorithmsGlobal powerful allianceDistributed algorithmsArticleElsevier