๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Self-Stabilizing Algorithms for Finding Centers and Medians of Trees

โœ Scribed by Bruell, Steven C.; Ghosh, Sukumar; Karaata, Mehmet Hakan; Pemmaraju, Sriram V.

Book ID
118178257
Publisher
Society for Industrial and Applied Mathematics
Year
1999
Tongue
English
Weight
315 KB
Volume
29
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

๐Ÿ“œ 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 self-stabilizing algorithm which finds
A self-stabilizing algorithm which finds a 2-center of a tree
โœ Tetz C. Huang; Ji-Cherng Lin; Hsueh-Jen Chen ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 884 KB

In this paper, we design a self-stabilizing algorithm which finds a 2-center for a distributed system with a tree topology. Our algorithm is based on the algorithm in [1][2][3]. The latter enables us to find the center (or centers) for the tree. If we sever the tree at the center (or centers), we ob