scientific article; zbMATH DE number 913359

DOI10.1002/(SICI)1097-0037(199605)27:3%3C203::AID-NET5%3E3.0.CO;2-MMaRDI QIDQ4887752zbMATH OpenFDO

Authors Hung-Kuei Ku, John P. Hayes

Publication date 5 August 1996

Full work available at URL https://doi.org/10.1002/(SICI)1097-0037(199605)27:3%3C203::AID-NET5%3E3.0.CO;2-M

zbMATH Keywords

edge fault tolerancefault-tolerant multiprocessor systemstree-structured networks

Mathematics Subject Classification ID

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

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

Cited in

(18)

• Using the redundant chords of the \(k\)-fault-tolerant graph to eliminate the effect of failed components
• Optimal 1-edge fault-tolerant designs for ladders.
• The structure of optimal edge fault tolerant graphs of star networks
• Christmas tree: a versatile 1-fault-tolerant design for token rings
• Homogeneous faults, colored edge graphs, and cover free families
• Analysis and design of a fault-tolerant tree architecture
• Fault tolerance and storage reduction in binary search trees
• Minced trees, with applications to fault-tolerant VLSI processor arrays
• Designing optimal fault-tolerant star networks
• Fault-tolerant extensions of star networks
• On Minimum Fault-Tolerant Networks
• Multiple-edge-fault-tolerant approximate shortest-path trees
• One node fault tolerance for caterpillars and starlike trees
• scientific article; zbMATH DE number 913340 (Why is no real title available?)
• Edge fault tolerance in graphs
• Longest fault-free paths in star graphs with vertex faults
• Designing distrance-preserving fault-tolerant topologies
• Efficient exploration of faulty trees

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)