On the Fault Tolerance of Some Popular Bounded-Degree Networks
From MaRDI portal
Publication:4210098
Recommendations
Cited in
(13)- Fault-tolerant analysis of a class of networks
- Cycles in butterfly graphs
- Sparse networks tolerating random faults.
- Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults
- (k,+)-distance-hereditary graphs
- scientific article; zbMATH DE number 4059297 (Why is no real title available?)
- Networks with small stretch number
- Minimum spanners of butterfly graphs
- On the fault tolerance of the butterfly
- Large fault-tolerant interconnection networks
- Self-spanner graphs
- scientific article; zbMATH DE number 1760005 (Why is no real title available?)
- Reconfiguring Arrays with Faults Part I: Worst-Case Faults
This page was built for publication: On the Fault Tolerance of Some Popular Bounded-Degree Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210098)