Conditional diagnosability of the round matching composition networks
From MaRDI portal
Publication:346253
DOI10.1016/j.tcs.2016.10.008zbMath1355.68025OpenAlexW2544094673MaRDI QIDQ346253
Publication date: 5 December 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.10.008
Related Items (7)
Vulnerability analysis of multiprocessor system based on burnt pancake networks ⋮ Diagnosability for two families of composition networks ⋮ Connectivity for some families of composition networks ⋮ Diagnosability of multigraph composition networks ⋮ The Component (Edge) Connectivity of Round Matching Composition Networks ⋮ Fault diagnosability of DQcube under the PMC model ⋮ Reliability of the round matching composition networks based on \(g\)-extra conditional fault
Cites Work
- On the conditional diagnosability of matching composition networks
- Conditional diagnosability of arrangement graphs under the PMC model
- Fault-tolerant diameter for three family interconnection networks
- Conditional diagnosability and strong diagnosability of split-star networks under the PMC model
- Fault diagnosability of arrangement graphs
- On conditional fault tolerance and diagnosability of hierarchical cubic networks
- Conditional diagnosability of bubble-sort star graphs
- Super-connectivity and super-edge-connectivity for some interconnection networks
- The diagnosability of triangle-free graphs
- Lee distance and topological properties of k-ary n-cubes
- The Conditional Diagnosability of k-Ary n-Cubes under the Comparison Diagnosis Model
- On self-diagnosable multiprocessor systems: diagnosis by the comparison approach
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
This page was built for publication: Conditional diagnosability of the round matching composition networks
