𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Self-stabilizing Algorithm for the Median Problem in

✍ Scribed by Victor Chepoi; Tristan Fevat; Emmanuel Godard; Yann Vaxès

Publisher
Springer
Year
2010
Tongue
English
Weight
759 KB
Volume
62
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A self-stabilizing algorithm for the sho
A self-stabilizing algorithm for the shortest path problem in a distributed system
✍ Tetz C. Huang; Ji-Cherng Lin 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 352 KB

In this paper, we propose a self-stabilizing algorithm for finding shortest paths in a distributed system in which a central daemon is assumed. The correctness of the proposed algorithm is proved by using the bounded function technique.

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 for the sho
A self-stabilizing algorithm for the shortest path problem assuming the distributed demon
✍ Tetz C. Huang 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 1015 KB

Shortest path finding has a variety of applications in transportation and communication. In this paper, we study a well-known self-stabilizing algorithm for the shortest path problem for the distributed systems. The prevlotm works on this topic had two assumptions that can be relaxed in this paper.

A self-stabilizing distributed algorithm
A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph
✍ G. Antonoiu; P.K. Srimani 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 640 KB

Minimal Spanning Tree (MST) problem in an arbitrary undirected graph is an important problem in graph theory and has extensive applications. Numerous algorithms are available to compute an MST. Our purpose here is to propose a self-stabilizing distributed algorithm for the MST problem and to prove i