𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fault-tolerant broadcast graphs

✍ Scribed by Arthur L. Liestman

Publisher
John Wiley and Sons
Year
1985
Tongue
English
Weight
555 KB
Volume
15
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Fault-tolerant broadcasts
Fault-tolerant broadcasts
✍ Fred B. Schneider; David Gries; Richard D. Schlichting πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 925 KB
Fault-tolerant minimum broadcast network
Fault-tolerant minimum broadcast networks
✍ Ahlswede, R.; Gargano, L.; Haroutunian, H. S.; Khachatrian, L. H. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 978 KB

Broadcasting is the task of transmitting a message originated at one processor of a communication network to all other processors in the network. A minimal k-fault-tolerant broadcast network is a communication network on n vertices in which any processor can broadcast in spite of up to k line failur

Fault-Tolerant Broadcasting in Radio Net
Fault-Tolerant Broadcasting in Radio Networks
✍ Evangelos Kranakis; Danny Krizanc; Andrzej Pelc πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 151 KB

We consider broadcasting in radio networks that are subject to permanent node failures of unknown location. Nodes are spread in a region in some regular way. We consider two cases: nodes are either situated at integer points of a line or they are situated in the plane, at grid points of a square or

Fault-tolerant graphs for tori
Fault-tolerant graphs for tori
✍ Yamada, Toshinori; Ueno, Shuichi πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 118 KB πŸ‘ 2 views

Motivated by the design of fault-tolerant multiprocessor interconnection networks, this paper considers the following problem: Given a positive integer t and a graph H, construct a graph G from H by adding a minimum number D(t, H) of edges such that even after deleting any t edges from G the remaini