A Note on Optimal Time Broadcast in Faulty Hypercubes
โ Scribed by D. Peleg
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 309 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
โฆ Synopsis
This note describes an algorithm for broadcasting a message on the (n)-dimensional hypercube in optimal time ( (n) time units) and optimal communication ( (2^{n}-1) messages) in the presence of up to (n-2) arbitrary node or edge faults, assuming the set of faults is known to all nodes of the hypercube. 1995 Academic Press, Inc.
๐ SIMILAR VOLUMES
## Summa y Nonparametric teats for ordered alternatives in randomised block designs based on within block rankings have been proposed by many authors. This note is concerned with the optimality of the choice of so-called regression constants usually considered in such rank tests. Some examples are