Designing distrance-preserving fault-tolerant topologies

DOI10.1007/3-540-62559-3_28MaRDI QIDQ6550558zbMATHFDO

Authors Swamy K. Sitarama, Abdol-Hossein Esfahanian

Publication date 5 June 2024

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• scientific article; zbMATH DE number 2038887
• Distributed constructions of dual-failure fault-tolerant distance preservers
• scientific article; zbMATH DE number 913359
• On Minimum Fault-Tolerant Networks
• Preserving distances in very faulty graphs

Cites work

• scientific article; zbMATH DE number 3891426 (Why is no real title available?)
• scientific article; zbMATH DE number 3813660 (Why is no real title available?)
• scientific article; zbMATH DE number 194437 (Why is no real title available?)
• scientific article; zbMATH DE number 3218574 (Why is no real title available?)
• A Graph Model for Fault-Tolerant Computing Systems
• Chordal rings as fault-tolerant loops
• Circulants and their connectivities
• Edge fault tolerance in graphs
• Geodetic connectivity of graphs
• Graphs with small diameter after edge deletion
• MinimumK-hamiltonian graphs
• Reliabilities of chordal rings
• Reliable circulant networks with minimum transmission delay
• The complexity of finding maximum disjoint paths with length constraints

This page was built for publication: Designing distrance-preserving fault-tolerant topologies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550558)