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

A self-stabilizing algorithm for bridge finding

โœ Scribed by Mehmet Hakan Karaata; Pranay Chaudhuri

Publisher
Springer-Verlag
Year
1999
Tongue
English
Weight
83 KB
Volume
12
Category
Article
ISSN
0178-2770

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Stabilizing Algorithm for Finding Bico
A Stabilizing Algorithm for Finding Biconnected Components
โœ Mehmet Hakan Karaata ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 209 KB

In this paper, a self-stabilizing algorithm is presented for finding biconnected components of a connected undirected graph on a distributed or network model of computation. The algorithm is resilient to transient faults, therefore, it does not require initialization. The proposed algorithm is based

A self-stabilizing enumeration algorithm
A self-stabilizing enumeration algorithm
โœ Emmanuel Godard ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 99 KB

This paper describes a self-stabilizing version of an algorithm presented by A. Mazurkiewicz [Inform. Process. Lett. 61 (1997) 233-239] for enumerating nodes by local rules on an anonymous network. The result improves the reliability aspects of the original algorithm and underlines the importance of