Self-stabilizing distributed algorithms for graph alliances

Authors:
Zhenyu Xu;Pradip K. Srimani
Affiliations:
Department of Computer Science, Clemson University, Clemson, SC;Department of Computer Science, Clemson University, Clemson, SC
Venue:
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Year:
2006

Citing 4
Cited 2

Self-stabilization

ACM Computing Surveys (CSUR)
Self-stabilizing systems in spite of distributed control

Communications of the ACM
1983 Invited address solved problems, unsolved problems and non-problems in concurrency

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
When graph theory helps self-stabilization

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing

Global defensive alliances in star graphs

Discrete Applied Mathematics
Global defensive alliances of trees and Cartesian product of paths and cycles

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.