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

An efficient fault-containing self-stabilizing algorithm for the shortest path problem

โœ Scribed by Tetz C. Huang

Publisher
Springer-Verlag
Year
2006
Tongue
English
Weight
369 KB
Volume
19
Category
Article
ISSN
0178-2770

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 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 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.

An Incremental Algorithm for a Generaliz
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
โœ G. Ramalingam; Thomas Reps ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 363 KB

The grammar problem, a generalization of the single-source shortest-path prob-ลฝ ลฝ . ลฝ . . lem introduced by D. E. Knuth Inform. Process. Lett. 6 1 1977 , 1แŽ5 is to compute the minimum-cost derivation of a terminal string from each nonterminal of a given context-free grammar, with the cost of a deriv