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

A unidirectional ring partition problem

โœ Scribed by Jyun-Jy Hu; Shi-Nine Yang; Maw-Sheng Chern

Publisher
John Wiley and Sons
Year
1993
Tongue
English
Weight
468 KB
Volume
23
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Partition Problem
A Partition Problem
โœ J.W. Sander ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 458 KB
A problem of restricted partitions
A problem of restricted partitions
โœ V. R. R. Uppuluri; J. A. Carpenter ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 186 KB
A note on the bottleneck graph partition
A note on the bottleneck graph partition problem
โœ Klinz, Bettina; Woeginger, Gerhard J. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 47 KB ๐Ÿ‘ 2 views

The bottleneck graph partition problem consists of partitioning the vertices of an undirected edge-weighted graph into two equally sized sets such that the maximum edge weight in the cut separating the two sets becomes minimum. In this short note, we present an optimum algorithm for this problem wit

A Latency Optimal Superstabilizing Mutua
A Latency Optimal Superstabilizing Mutual Exclusion Protocol in Unidirectional Rings
โœ Yoshiaki Katayama; Eiichiro Ueda; Hideo Fujiwara; Toshimitsu Masuzawa ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 260 KB

A self-stabilizing protocol is a protocol that achieves its intended behavior regardless of the initial configuration. Thus, a self-stabilizing protocol is resilient to any number and any type of transient faults. A self-stabilizing protocol is called a superstabilizing protocol if it can recover fr