On optimal broadcasting in faulty hypercubes

DOI10.1016/0166-218X(94)90175-9zbMath0807.94027MaRDI QIDQ1339875

Jehoshua Bruck

Publication date: 11 December 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

hypercube\(n\)-cubespanning trees

Mathematics Subject Classification ID

Trees (05C05) Communication networks in operations research (90B18) Applications of graph theory to circuits and networks (94C15)

Related Items

Reliable broadcasting, Deterministic Models of Communication Faults

Cites Work

• Broadcasting with random faults
• A note on optimal time broadcast in faulty hypercubes
• Randomized broadcast in networks
• Fault-tolerant broadcast graphs
• A survey of gossiping and broadcasting in communication networks
• Time bounds on fault‐tolerant broadcasting
• Optimum broadcasting and personalized communication in hypercubes