scientific article; zbMATH DE number 913541

MaRDI QIDQ4887812zbMATH OpenFDO

Authors John P. Hayes

Publication date 5 August 1996

zbMATH Keywords

edge fault-tolerant graphsmultiprocessorsstructural failures

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 861431
• scientific article; zbMATH DE number 913340
• Fault tolerance in the arrangement graphs
• Edge fault tolerance in graphs
• scientific article; zbMATH DE number 3990887
• Fault Tolerance on Star Graphs
• Fault tolerance in bubble-sort graph networks
• Fault tolerance of Cayley graphs
• Realizability of fault-tolerant graphs
• Conditional fault tolerance of arrangement graphs

Cited in

(15)

• Fault-tolerance analysis of multibus multiprocessor system
• Combinatorial techniques and objects in computer science: Fault-tolerance and other interesting applications
• Edge-colored graphs with applications to homogeneous faults
• Fault tolerance in large games
• Minimized embedding of arbitrary Hamiltonian graphs in fault-tolerant graph and reconfiguration at faults. I: One-fault-tolerant structures
• A graph partitioning scheme and applications to fault tolerant computing
• Homogeneous faults, colored edge graphs, and cover free families
• scientific article; zbMATH DE number 3843670 (Why is no real title available?)
• scientific article; zbMATH DE number 4208113 (Why is no real title available?)
• The Fault Tolerance of NP-Hard Problems
• scientific article; zbMATH DE number 1043884 (Why is no real title available?)
• Connectivity
• scientific article; zbMATH DE number 1857646 (Why is no real title available?)
• Fault-tolerant logical network structures
• Function of structural fault tolerance and d-limited connected component of CS graph

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