Sciweavers

Share
IPPS
2006
IEEE

Self-stabilizing distributed algorithms for graph alliances

12 years 5 months ago
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.
Zhenyu Xu, Pradip K. Srimani
Added 11 Jun 2010
Updated 11 Jun 2010
Type Conference
Year 2006
Where IPPS
Authors Zhenyu Xu, Pradip K. Srimani
Comments (0)
books