Self-stabilizing distributed algorithms for graph alliances

Graph alliances are recently developed global properties 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.

• Type: Conference
• Year: 2006
• Where: IPPS
• Authors: Zhenyu Xu, Pradip K. Srimani
• Keywords: Distributed And Parallel Computing, Graph Alliances, IPPS 2006, Self-stabilizing Fault Tolerant, Symmetric Graph