1 research outputs found
Broadcasting in unlabeled hypercubes with a linear number of messages
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)