1998-05-29
Broadcasting in unlabeled hypercubes with a linear number of messages
Publication
Publication
Information Processing Letters , Volume 66 - Issue 4 p. 181- 186
We consider broadcasting a message from one node to all other nodes of an asynchronous totally unlabeled n-node hypercube. Neither nodes nor links have a priori assigned labels. We show a broadcasting algorithm which uses only O(n) messages. This answers affirmatively an open question of G. Tel (1995).
| Additional Metadata | |
|---|---|
| , , | |
| Information Processing Letters | |
| Organisation | School of Computer Science |
|
Diks, K. (Krzysztof), Dobrev, S. (Stefan), Kranakis, E, Pelc, A. (Andrzej), & Ružička, P. (Peter). (1998). Broadcasting in unlabeled hypercubes with a linear number of messages. Information Processing Letters, 66(4), 181–186.
|
|