The diagnosability of the k-ary n-cubes using the pessimistic strategy
From MaRDI portal
Publication:2887017
Recommendations
Cites work
- Diagnosability of enhanced hypercubes
- Graph theory with applications
- Lee distance and topological properties of k-ary n-cubes
- On Fault Identification in Diagnosable Systems
- On conditional diagnosability of the folded hypercubes
- On diagnosability of large fault sets in regular topology-based computer systems
- Strongly Diagnosable Systems under the Comparison Diagnosis Model
Cited in
(9)- The \(t/k\)-diagnosability of \(m\)-ary \(n\)-cube networks
- The pessimistic diagnosability of data center networks
- Reliability analysis of Cayley graphs generated by transpositions
- Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs
- Reliability evaluation of complete graph-based recursive networks
- The pessimistic diagnosability of three kinds of graphs
- The local diagnosability of \(k\)-ary \(n\)-cube.
- The pessimistic diagnosabilities of some general regular graphs
- The \(t/m\)-diagnosis strategy of augmented \(k\)-ary \(n\)-cubes
This page was built for publication: The diagnosability of the \(k\)-ary \(n\)-cubes using the pessimistic strategy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2887017)