Fault-tolerant broadcast graphs

DOI10.1002/net.3230150203zbMath0579.94030OpenAlexW1989628484MaRDI QIDQ3703811

Arthur L. Liestman

Publication date: 1985

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027/uiuo.ark:/13960/t2k71ch91

zbMATH Keywords

communication networkinformation disseminationBroadcasting

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Related Items

Binary linear programming models for robust broadcasting in communication networks ⋮ Automorphisms of broadcasting schemes with respect to start rounds ⋮ On optimal broadcasting in faulty hypercubes ⋮ Reliable broadcasting ⋮ Broadcasting with random faults ⋮ Broadcasting with linearly bounded transmission faults ⋮ Time-relaxed broadcasting in communication networks ⋮ A COMPOUNDING ALGORITHM FOR 1-FAULT TOLERANT BROADCAST NETWORKS ⋮ Broadcasting from multiple originators ⋮ k-Broadcasting in trees ⋮ A 1-relaxed minimum broadcast graph on 15 vertices. ⋮ Communication complexity of fault-tolerant information diffusion ⋮ Graph theoretical issues in computer networks