𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimum-time line broadcast networks

✍ Scribed by Arthur M. Farley

Publisher
John Wiley and Sons
Year
1980
Tongue
English
Weight
627 KB
Volume
10
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Minimum-cost line broadcast in paths
Minimum-cost line broadcast in paths
✍ Satoshi Fujita; Arthur M. Farley πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 871 KB

Under the line communication protocol, calls can be placed between pairs of non-adjacent sites over a path of lines connecting them; only one call can utilize a line at any time. This paper addresses questions regarding the cumulative cost, i.e., sum of lengths of calls, of broadcasting under the li

Degree- and time-constrained broadcast n
Degree- and time-constrained broadcast networks
✍ Michael J. Dinneen; Geoffrey Pritchard; Mark C. Wilson πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 493 KB

## Abstract We consider the problem of constructing networks with as many nodes as possible, subject to upper bounds on the degree and broadcast time. This paper includes the results of an extensive empirical study of broadcasting in small regular graphs using a stochastic search algorithm to appro