scientific article; zbMATH DE number 3990887

MaRDI QIDQ3753503zbMATH OpenFDO

Authors Edward T. Ordman

Publication date 1987

zbMATH Keywords

distributed computingcomputer communication networksfault tolerant algorithmsbyzantine agreement

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Applications of graph theory to circuits and networks (94C15) Theory of operating systems (68N25)

Recommendations

• scientific article; zbMATH DE number 3843670
• Fault-tolerant broadcast graphs
• Publication:4887730
• scientific article; zbMATH DE number 861431
• Fault Tolerance in Networks of Bounded Degree
• Optimal fault-tolerant routings for connected graphs
• Network Failure Detection and Graph Connectivity
• Network failure detection and graph connectivity
• Fault-tolerant analysis of a class of networks
• Fault tolerance of the star graph interconnection network

Cited in

(9)

• The Connection Network class for Fault Tolerant Meshes
• Transposition networks as a class of fault-tolerant robust networks
• Fault-tolerant analysis of a class of networks
• Fault tolerant reachability for directed graphs
• Generalized degrees and Menger path systems
• Fault-tolerant routing in circulant networks and cycle prefix networks
• Fault-tolerant broadcast graphs
• scientific article; zbMATH DE number 913541 (Why is no real title available?)
• On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs

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