Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults

DOI10.1137/0405015zbMath0751.94014OpenAlexW1988409117MaRDI QIDQ4012443

Ugo Vaccaro, Luisa Gargano

Publication date: 27 September 1992

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0405015

zbMATH Keywords

communication networksbroadcastingfault-tolerant communication

Mathematics Subject Classification ID

Paths and cycles (05C38) Applications of graph theory to circuits and networks (94C15)

Related Items (7)

Binary linear programming models for robust broadcasting in communication networks ⋮ Reliable broadcasting ⋮ Minimum time broadcast in faulty star networks ⋮ Broadcasting with linearly bounded transmission faults ⋮ Broadcasting in hypercubes with randomly distributed Byzantine faults ⋮ Communication complexity of fault-tolerant information diffusion ⋮ Graph theoretical issues in computer networks

This page was built for publication: Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults