We propose a self-stabilizing algorithm (protocol) for leader election in a tree graph. We show the correctness of the proposed algorithm by using a new technique involving induction.
A Self-Stabilizing Algorithm for Detecting Fundamental Cycles in a Graph
β Scribed by Pranay Chaudhuri
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 137 KB
- Volume
- 59
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We propose a self-stabilizing algorithm (protocol) for computing the median in a given tree graph. We show the correctness of the proposed algorithm by using a new technique involving induction.
## SUM MARY An efficient algorithm is developed for the formation of a minimal cycle basis of a graph. This method reduces the number of cycles to be considered as (candidates for being the elements of a minimal basis and makes practical use of the Greedy algorithm feasible. A comparison is made b
## Abstract Lowβfrequency oscillations (<0.08 Hz) have been detected in functional MRI studies, and appear to be synchronized between functionally related areas. A current challenge is to detect these patterns without using an external reference. Selfβorganizing maps (SOMs) offer a way to automatic
Adiabatic decoupling is as dependent on well-designed inversion pulse can be a sizable fraction of 1/J. However, phase cycles for performance as any broadband method. pulse length and RF field strength can be varied indepen-For example, the dramatic performance gains of STUD (1) dently in adiabatic