7 search results - page 1 / 2 » Self-stabilizing distributed algorithms for graph alliances |
HIPC
2003
Springer
13 years 10 months ago
2003
Springer
SOFSEM
1997
Springer
13 years 9 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
PPL
2008
13 years 4 months ago
2008
We provide self-stabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linea...
IPPS
2006
IEEE
13 years 11 months ago
2006
IEEE
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 algorith...
ALENEX
2007
13 years 6 months ago
2007
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...