Diagnosability of multigraph composition networks
From MaRDI portal
Recommendations
- Diagnosability for two families of composition networks
- Diagnosability of Two-Matching Composition Networks
- Conditional diagnosability of the round matching composition networks
- On the conditional diagnosability of matching composition networks
- Conditional diagnosability of component-composition graphs under the PMC model
Cites work
- An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems
- An Algorithmic Approach to Conditional-Fault Local Diagnosis of Regular Multiprocessor Interconnected Systems under the PMC Model
- Conditional Diagnosability of Alternating Group Graphs
- Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model
- Conditional diagnosability of the round matching composition networks
- Diagnosability for two families of composition networks
- Diagnosability of star graphs under the comparison diagnosis model
- Fault diagnosability of data center networks
- On self-diagnosable multiprocessor systems: diagnosis by the comparison approach
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
- Recursive circulants and their embeddings among hypercubes
- Restricted connectivity for three families of interconnection networks
- Strongly Diagnosable Systems under the Comparison Diagnosis Model
Cited in
(4)
This page was built for publication: Diagnosability of multigraph composition networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6150679)