Designing distrance-preserving fault-tolerant topologies

DOI10.1007/3-540-62559-3_28zbMATH Open1539.68235MaRDI QIDQ6550558FDOQ6550558

Authors: Swamy K. Sitarama, Abdol-Hossein Esfahanian 

Publication date: 5 June 2024

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

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)

Cites Work

• Circulants and their connectivities
• Title not available (Why is that?)
• Reliable circulant networks with minimum transmission delay
• A Graph Model for Fault-Tolerant Computing Systems
• The complexity of finding maximum disjoint paths with length constraints
• Edge fault tolerance in graphs
• Geodetic connectivity of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• MinimumK-hamiltonian graphs
• Graphs with small diameter after edge deletion
• Title not available (Why is that?)
• Chordal rings as fault-tolerant loops
• Reliabilities of chordal rings

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)