Sciweavers

158 search results - page 1 / 32
» A Self-stabilizing Algorithm for Graph Searching in Trees
Sort
View
SOFSEM
1997
Springer
13 years 9 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
IPPS
2005
IEEE
13 years 10 months ago
Self-Stabilizing Anonymous Leader Election in a Tree
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...
Zhenyu Xu, Pradip K. Srimani
OPODIS
2004
13 years 6 months ago
Self-optimizing DHTs Using Request Profiling
S (in alphabetic order by speaker surname) Speaker: Uri Abraham (Ben-Gurion University) Title: Self-Stabilizing TimeStamps : Speaker: Anish Arora (Ohio State) Title: Self-Stabilizi...
Alina Bejan, Sukumar Ghosh
ALGORITHMS
2010
114views more  ALGORITHMS 2010»
13 years 2 months ago
Graph Extremities Defined by Search Algorithms
: Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search a...
Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Ge...
SSS
2009
Springer
107views Control Systems» more  SSS 2009»
13 years 11 months ago
A Self-stabilizing Algorithm for Graph Searching in Trees
Graph searching games have been extensively studied in the past years. The graph searching problem involves a team of searchers who are attempting to capture a fugitive moving alon...
Rodica Mihai, Morten Mjelde