scientific article; zbMATH DE number 908506

zbMATH Open0849.94031MaRDI QIDQ4887889FDOQ4887889

Authors: Siu-Cheung Chau, Arthur L. Liestman 

Publication date: 17 November 1996

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 961881
• Fault-tolerant broadcast graphs
• scientific article; zbMATH DE number 2197956
• scientific article; zbMATH DE number 3948154
• Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Circuits, networks (94C99) Network design and communication in computer systems (68M10)

Cited In (11)

• Verifiable broadcasting and gossiping in communication networks
• Reliable broadcasting
• A COMPOUNDING ALGORITHM FOR 1-FAULT TOLERANT BROADCAST NETWORKS
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new method for constructing minimal broadcast networks
• Title not available (Why is that?)
• Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults
• The even adjacency split problem for graphs
• Minimum time broadcast in faulty star networks
• Fault-tolerant broadcasts

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4887889)