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

Author(s) :
Belhoul, Yacine
Yahiaoui, Saïd
Date :
2013-05Abstract
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
Subject:
Self-stabilizing algorithms, Graph algorithms, Global powerful alliance, Distributed algorithms
Source:
ISSN :0020-0190
Publisher/Institution:
ELSEVIER SCIENCE
Copyright : Elsevier