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

A self-stabilizing algorithm for constructing spanning trees

โœ Scribed by Nian-Shing Chen; Hwey-Pyng Yu; Shing-Tsaan Huang

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
663 KB
Volume
39
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Parallel Algorithm for Computing Minim
A Parallel Algorithm for Computing Minimum Spanning Trees
โœ D.B. Johnson; P. Metaxas ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 840 KB

We present a simple and implementable algorithm that computes a minimum spanning tree of an undirected weighted graph \(G=(V, E)\) of \(n=|V|\) vertices and \(m=|E|\) edges on an EREW PRAM in \(O\left(\log ^{3 / 2} n\right)\) time using \(n+m\) processors. This represents a substantial improvement i

A Self-Stabilizing Leader Election Algor
A Self-Stabilizing Leader Election Algorithm for Tree Graphs
โœ Gheorghe Antonoiu; Pradip K. Srimani ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 231 KB

We propose a self-stabilizing algorithm (protocol) for leader election in a tree graph. We show the correctness of the proposed algorithm by using a new technique involving induction.