scientific article; zbMATH DE number 913359

DOI10.1002/(SICI)1097-0037(199605)27:3%3C203::AID-NET5%3E3.0.CO;2-MzbMATH Open0851.90040MaRDI QIDQ4887752FDOQ4887752

John P. Hayes, Hung-Kuei Ku

Publication date: 5 August 1996

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

Recommendations

• Multiple-edge-fault-tolerant approximate shortest-path trees
• Multiple-edge-fault-tolerant approximate shortest-path trees
• Fault-tolerant approximate shortest-path trees
• Fault-tolerant approximate shortest-path trees
• Path-fault-tolerant approximate shortest-path trees
• Sparse fault-tolerant BFS trees
• Dynamic Fault Tolerance in Fat Trees
• Optimal broadcasting in faulty trees
• scientific article; zbMATH DE number 1760005
• Edge fault tolerance in graphs

zbMATH Keywords

edge fault tolerancetree-structured networksfault-tolerant multiprocessor systems

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Communication networks in operations research (90B18)

Cited In (12)

• Efficient exploration of faulty trees
• Optimal 1-edge fault-tolerant designs for ladders.
• Longest fault-free paths in star graphs with vertex faults
• Multiple-edge-fault-tolerant approximate shortest-path trees
• Title not available (Why is that?)
• Using the redundant chords of the \(k\)-fault-tolerant graph to eliminate the effect of failed components
• Designing optimal fault-tolerant star networks
• The structure of optimal edge fault tolerant graphs of star networks
• On Minimum Fault-Tolerant Networks
• Minced trees, with applications to fault-tolerant VLSI processor arrays
• Fault tolerance and storage reduction in binary search trees
• Fault-tolerant extensions of star 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 Q4887752)