Sciweavers

Share
7 search results - page 1 / 2
» Self-stabilizing distributed algorithms for graph alliances
Sort
View
HIPC
2003
Springer
12 years 7 months ago
Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph
Wayne Goddard, Stephen T. Hedetniemi, David Pokras...
SOFSEM
1997
Springer
12 years 5 months ago
Time Optimal Self-Stabilizing Algorithms
: 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...
Rastislav Kralovic
PPL
2008
94views more  PPL 2008»
12 years 1 months ago
Self-Stabilizing Graph Protocols
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...
Wayne Goddard, Stephen T. Hedetniemi, David Pokras...
IPPS
2006
IEEE
12 years 7 months ago
Self-stabilizing distributed algorithms for graph alliances
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...
Zhenyu Xu, Pradip K. Srimani
ALENEX
2007
102views Algorithms» more  ALENEX 2007»
12 years 3 months ago
Linearization: Locally Self-Stabilizing Sorting in Graphs
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...
Melih Onus, Andréa W. Richa, Christian Sche...
books