loading...
Distributed Protocols for Defensive and Offensive Alliances in Network Graphs Using Self-Stabilization
Kolkata, India March 05-March 07
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICCTA.2007.54International Conference on Computing ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Pradip K. Srimani, Clemson University, USA
Zhenyu Xu, Clemson University, USA
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.
Citation:
Pradip K. Srimani, Zhenyu Xu, "Distributed Protocols for Defensive and Offensive Alliances in Network Graphs Using Self-Stabilization," iccta, pp.27-31, International Conference on Computing: Theory and Applications (ICCTA'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.