On the conditional diagnosability of matching composition networks
From MaRDI portal
(Redirected from Publication:300261)
Recommendations
- Conditional diagnosability of a class of matching composition networks under the comparison model
- Conditional diagnosability of the round matching composition networks
- Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model
- Diagnosability of Two-Matching Composition Networks
- Conditional diagnosability of component-composition graphs under the PMC model
Cites work
- A general technique to establish the asymptotic conditional diagnosability of interconnection networks
- Component connectivity of the hypercubes
- Conditional diagnosability of alternating group networks
- Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model
- Efficient Fault Identification of Diagnosable Systems under the Comparison Model
- Linearly many faults in 2-tree-generated networks
- Linearly many faults in Cayley graphs generated by transposition trees
- Linearly many faults in \((n,k)\)-star graphs
- Linearly many faults in dual-cube-like networks
- On deriving conditional diagnosability of interconnection networks
- On self-diagnosable multiprocessor systems: diagnosis by the comparison approach
- On the maximal connected component of a hypercube with faulty vertices III
- On the maximal connected component of hypercube with faulty vertices
- On the maximal connected component of hypercube with faulty vertices (II)
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
- Strong Diagnosability and Conditional Diagnosability of Multiprocessor Systems and Folded Hypercubes
- Strongly Diagnosable Product Networks Under the Comparison Diagnosis Model
- Strongly Diagnosable Systems under the Comparison Diagnosis Model
- The Conditional Diagnosability of k-Ary n-Cubes under the Comparison Diagnosis Model
- The conditional fault diagnosability of (n, k)-star graphs
Cited in
(18)- On the conditional diagnosability of hyper-buttery graphs and related networks
- Structural properties of generalized exchanged hypercubes
- The relationship between extra connectivity and conditional diagnosability of regular graphs under the PMC model
- Diagnosability of multigraph composition networks
- The \(g\)-extra conditional diagnosability and sequential \(t/k\)-diagnosability of hypercubes
- Strong diagnosability and conditional diagnosability of optical multi-mesh hypercube networks under the PMC model
- The \(g\)-good-neighbor conditional diagnosability of star graphs under the PMC and MM* model
- Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks
- On conditional fault tolerance and diagnosability of hierarchical cubic networks
- Edge-fault-tolerant strong Menger edge connectivity on regular graphs
- Conditional diagnosability of bubble-sort star graphs
- Length two path centered surface areas of the \((n, k)\)-star graph
- Diagnosability of Two-Matching Composition Networks
- The \(g\)-good neighbor conditional diagnosability of twisted hypercubes under the PMC and MM* model
- Conditional diagnosability of the round matching composition networks
- The \(g\)-good-neighbor conditional diagnosabilities of hypermesh optical interconnection networks under the PMC and comparison models
- Conditional diagnosability of the \(\mathit{SP}_n\) graphs under the comparison diagnosis model
- Conditional diagnosability of a class of matching composition networks under the comparison model
This page was built for publication: On the conditional diagnosability of matching composition networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q300261)
