𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Self-Stabilizing Leader Election Algorithm for Tree Graphs

✍ Scribed by Gheorghe Antonoiu; Pradip K. Srimani

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
231 KB
Volume
34
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

A Self-Stabilizing Distributed Algorithm
A Self-Stabilizing Distributed Algorithm to Find the Median of a Tree Graph
✍ Gheorghe Antonoiu; Pradip K. Srimani πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 231 KB

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.

A linear-time algorithm for connectedr-d
A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs
✍ BrandstοΏ½dt, Andreas; Dragan, Feodor F. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 83 KB πŸ‘ 1 views

A distance-hereditary graph is a connected graph in which every induced path is isometric, i.e., the distance of any two vertices in an induced path equals their distance in the graph. We present a linear time labeling algorithm for the minimum cardinality connected r-dominating set and Steiner tree