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

A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph

โœ Scribed by G. Antonoiu; P.K. Srimani

Book ID
108022533
Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
448 KB
Volume
30
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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 distributed algorithm
A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks
โœ H. Baala; O. Flauzac; J. Gaber; M. Bui; T. El-Ghazawi ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 388 KB

Spanning trees help removing cycles and establishing short paths between a given node and the rest of the nodes in a network. In ad hoc mobile computing networks, however, transient node failures occur due to being out of range or powered off. Therefore, we present a self-stabilized distributed algo