Self-stabilizing distributed algorithms for graph alliances
Zhenyu Xu, Pradip K. Srimani · 2006
Graph alliances are recently developed global prop-erties of any symmetric graph. Our purpose in the present paper is to design self-stabilizing fault tolerant distributed algorithms for the global offensive and the global defensive alliance in a given arbitrary graph. We also provide complete analysis of the convergence time of both the algorithms. 1.