✦ LIBER ✦

An efficient distributed algorithm for centering a spanning tree of a biconnected graph

✍ Scribed by R.F.M. Aranha; C.Pandu Rangan

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 537 KB
Volume: 59
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(96)00102-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear algorithm for centering a spann

A linear algorithm for centering a spanning tree of a biconnected graph

✍ K.S. Easwarakumar; C.Pandu Rangan; G.A. Cheston 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 381 KB

A linear algorithm for bipartition of bi

A linear algorithm for bipartition of biconnected graphs

✍ Hitoshi Suzuki; Naomi Takahashi; Takao Nishizeki 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 343 KB

An O(log n) parallel algorithm for const

An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs

✍ Wang Yue-Li; Chen Hon-Chan; Lee Chen-Yu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 396 KB

An algorithm for finding a short closed

An algorithm for finding a short closed spanning walk in a graph

✍ K. Takamizawa; T. Nishizeki; N. Saito 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 653 KB

A Parallel Recursive Shortest Spanning T

A Parallel Recursive Shortest Spanning Tree Algorithm for Image Segmentation in Distributed Computing Environment

✍ S.H Kwok; A.G Constantinides 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 667 KB

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.