scientific article; zbMATH DE number 4053528

zbMATH Open0645.94026MaRDI QIDQ3789491FDOQ3789491

Authors: Arthur M. Farley 

Publication date: 1987

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

Recommendations

• Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults
• scientific article; zbMATH DE number 961881
• scientific article; zbMATH DE number 908506
• Time-relaxed 1-fault tolerant broadcast networks
• Time bounds on fault‐tolerant broadcasting

zbMATH Keywords

communication networkminimum-time broadcast networksoperational specifications

Mathematics Subject Classification ID

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

Cited In (10)

• Fault—tolerant hypercube broadcasting via information dispersal
• Minimum-time multidrop broadcast
• Reliable communication in networks with Byzantine link failures
• Reliable broadcasting
• Minimum self-repairing graphs
• Time-relaxed 1-fault tolerant broadcast networks
• Title not available (Why is that?)
• A survey of gossiping and broadcasting in communication networks
• Minimum time broadcast in faulty star networks
• Reliable broadcasting in double loop networks

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 Q3789491)