7 search results - page 2 / 2 » Self-stabilizing distributed algorithms for graph alliances |
IPPS
2005
IEEE
13 years 10 months ago
2005
IEEE
We propose a new self-stabilizing anonymous leader election algorithm in a tree graph. We show the correctness of the protocol and show that the protocol terminates in O(n4 ) time...
PODC
2011
ACM
12 years 7 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...