Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

IPPS
2006
IEEE

favoriteEmaildiscussreport

113views Distributed And Parallel Com...» more IPPS 2006»

Self-stabilizing distributed algorithms for graph alliances

13 years 10 months ago

Self-stabilizing distributed algorithms for graph alliances

Download www.cecs.uci.edu

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 oﬀensive 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

Real-time Traffic

Distributed And Parallel Computing | Graph Alliances | IPPS 2006 | Self-stabilizing Fault Tolerant | Symmetric Graph |

claim paper

Related Content

» SelfStabilizing Distributed Algorithm for Strong Matching in a System Graph

» Time Optimal SelfStabilizing Algorithms

» SelfStabilizing Graph Protocols

» Linearization Locally SelfStabilizing Sorting in Graphs

» SelfStabilizing Anonymous Leader Election in a Tree

» Structuring unreliable radio networks

Post Info
More Details (n/a)

Added	11 Jun 2010
Updated	11 Jun 2010
Type	Conference
Year	2006
Where	IPPS
Authors	Zhenyu Xu, Pradip K. Srimani

Comments (0)