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