A Note on Optimal Time Broadcast in Faulty Hypercubes

David Peleg

Research output: Contribution to journalArticlepeer-review

11 Scopus citations


This note describes an algorithm for broadcasting a message on the n-dimensional hypercube in optimal time (n time units) and optimal communication (2n - 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.

Original languageEnglish
Pages (from-to)132-135
Number of pages4
JournalJournal of Parallel and Distributed Computing
Issue number1
StatePublished - Apr 1995
Externally publishedYes


Dive into the research topics of 'A Note on Optimal Time Broadcast in Faulty Hypercubes'. Together they form a unique fingerprint.

Cite this