A (4n − 9)/3 diagnosis algorithm for generalised cube networks
From MaRDI portal
Publication:3563367
Recommendations
- A \((4n - 9)/3\) diagnosis algorithm on \(n\)-dimensional cube network
- \(g\)-good-neighbor conditional diagnosability measures for 3-ary \(n\)-cube networks
- On the diagnosing algorithm for networks
- On conditional fault tolerance and diagnosability of hierarchical cubic networks
- The diagnosabilities of and diagnosis algorithms for regular networks under two three-valued models
- On g-extra conditional diagnosability of hierarchical cubic networks
- A Fast Pessimistic Diagnosis Algorithm for Hypercube-Like Networks under the Comparison Model
- The component connectivity, component diagnosability, and \(t/k\)-diagnosability of bicube networks
- Algorithms and Computation
- A Local Diagnosis Algorithm for Hypercube-like Networks under the BGM Diagnosis Model
Cites work
- A fast pessimistic one-step diagnosis algorithm for hypercube multicomputer systems
- A group-theoretic model for symmetric interconnection networks
- A lower bound on the size of \(k\)-neighborhood in generalized cubes
- A parallel routing algorithm on circulant networks employing the Hamiltonian circuit Latin square
- Hamiltonian properties on the class of hypercube-like networks
- Minimum neighborhood in a generalized cube
- On diagnosability of large fault sets in regular topology-based computer systems
- On Fault Isolation and Identification in t1/t1-Diagnosable Systems
- On the maximal connected component of hypercube with faulty vertices
- The locally twisted cubes
- The Mobius cubes
Cited in
(4)
This page was built for publication: A (4n − 9)/3 diagnosis algorithm for generalised cube networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563367)