Sparse networks tolerating random faults.
From MaRDI portal
Recommendations
Cites work
- A group-theoretic model for symmetric interconnection networks
- A guided tour of Chernoff bounds
- Algebra. An approach via module theory
- Expanding graphs contain all small trees
- Explicit construction of linear sized tolerant networks
- Finding a target subnetwork in sparse networks with random faults
- Interconnection Networks Based on a Generalization of Cube-Connected Cycles
Cited in
(10)- Finding a target subnetwork in sparse networks with random faults
- The diameter and connectivity of networks with random dependent faults
- Edge Fault Tolerance on Sparse Networks
- A COMPOUNDING ALGORITHM FOR 1-FAULT TOLERANT BROADCAST NETWORKS
- On the Fault Tolerance of Some Popular Bounded-Degree Networks
- Fault-Tolerant Circuit-Switching Networks
- Fault-Tolerant Meshes with Small Degree
- On the fault tolerance of fat-trees
- Fault-tolerant logical network structures
- Fault tolerant network constructors
This page was built for publication: Sparse networks tolerating random faults.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1427202)