Global defensive alliances in star graphs
Discrete Applied Mathematics
The south zone: distributed algorithms for alliances
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Global defensive alliances of trees and Cartesian product of paths and cycles
Discrete Applied Mathematics
| Hi-index | 0.00 |
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.