✦ LIBER ✦

A self-stabilizing algorithm for constructing breadth-first trees

✍ Scribed by Shing-Tsaan Huang; Nian-Shing Chen

Book ID: 107766096
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 797 KB
Volume: 41
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(92)90264-v

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A self-stabilizing algorithm for constru

A self-stabilizing algorithm for constructing spanning trees

✍ Nian-Shing Chen; Hwey-Pyng Yu; Shing-Tsaan Huang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 663 KB

A Dynamic Self-Stabilizing Algorithm for

A Dynamic Self-Stabilizing Algorithm for Constructing a Transport Net

✍ M. H. Karaata; P. Chaudhuri 📂 Article 📅 2002 🏛 Springer Vienna 🌐 English ⚖ 174 KB

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

Efficient algorithms for finding depth-f

Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs

✍ C. Rhee; Y.Daniel Liang; S.K. Dhall; S. Lakshmivarahan 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 512 KB

A parallel algorithm for constructing mi

A parallel algorithm for constructing minimum spanning trees

✍ Jon Louis Bentley 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 521 KB

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.