Diagnosability of multigraph composition networks
From MaRDI portal
Publication:6150679
DOI10.1016/j.tcs.2023.114375MaRDI QIDQ6150679
Sheng-Lung Peng, Rong-xia Hao, Xiao-Wen Qin
Publication date: 9 February 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Conditional diagnosability of the round matching composition networks
- Diagnosability of star graphs under the comparison diagnosis model
- Recursive circulants and their embeddings among hypercubes
- Diagnosability for two families of composition networks
- Restricted connectivity for three families of interconnection networks
- Fault diagnosability of data center networks
- Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model
- An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems
- Strongly Diagnosable Systems under the Comparison Diagnosis Model
- An Algorithmic Approach to Conditional-Fault Local Diagnosis of Regular Multiprocessor Interconnected Systems under the PMC Model
- Conditional Diagnosability of Alternating Group Graphs
- On self-diagnosable multiprocessor systems: diagnosis by the comparison approach
- Optimization of Reduced Dependencies for Synchronous Sequential Machines