Largest component and node fault tolerance for grids
From MaRDI portal
Publication:2656897
Recommendations
Cites work
- scientific article; zbMATH DE number 26495 (Why is no real title available?)
- scientific article; zbMATH DE number 1256708 (Why is no real title available?)
- (H,k) stable graphs with minimum size
- A Graph Model for Fault-Tolerant Computing Systems
- A survey of integrity
- Asymptotic Bounds on the Integrity of Graphs and Separator Theorems for Graphs
- Explicit construction of linear sized tolerant networks
- On Minimum Fault-Tolerant Networks
- On sparse graphs with dense long paths
- The integrity of a cubic graph
- Two results about the hypercube
Cited in
(3)
This page was built for publication: Largest component and node fault tolerance for grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2656897)