Conditional diagnosability of a class of matching composition networks under the comparison model
DOI10.1016/J.TCS.2017.02.010zbMATH Open1369.68063OpenAlexW2591499887MaRDI QIDQ528473FDOQ528473
Authors: Krishnaiyan Thulasiraman, Min Xu, Qiang Zhu
Publication date: 12 May 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.02.010
Recommendations
- Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model
- On the conditional diagnosability of matching composition networks
- Conditional diagnosability of component-composition graphs under the PMC model
- Conditional diagnosability of the round matching composition networks
- Diagnosability for two families of composition networks
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)
Cites Work
- Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model
- A survey of comparison-based system-level diagnosis
- The conditional diagnosability of crossed cubes under the comparison model
- An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems
- Strong Diagnosability and Conditional Diagnosability of Multiprocessor Systems and Folded Hypercubes
- On self-diagnosable multiprocessor systems: diagnosis by the comparison approach
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
- Characterization of Connection Assignment of Diagnosable Systems
- The Mobius cubes
- Diagnosability of regular systems
- On Fault Identification in Diagnosable Systems
- Diagnosis of ${t / {(t + 1)}}$-Diagnosable Systems
- Self-Implicating Structures for Diagnosable Systems
Cited In (29)
- On fault identification in interconnection networks under the comparison model
- Strong diagnosability of regular networks under the comparison model
- Probabilistic diagnosis of clustered faults for hypercube-based multiprocessor system
- Fault tolerance and diagnosability of burnt pancake networks under the comparison model
- The non-inclusive diagnosability of regular graphs
- Conditional diagnosability and strong diagnosability of shuffle-cubes under the comparison model
- On the conditional diagnosability of matching composition networks
- Conditional diagnosability of component-composition graphs under the PMC model
- The extra connectivity and extra diagnosability of regular interconnection networks
- On \(g\)-good-neighbor conditional diagnosability of \((n,k)\)-star networks
- Conditional diagnosability of hypermeshes under the comparison model
- A tree structure for local diagnosis in multiprocessor systems under the comparison model
- Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model
- The non-inclusive diagnosability of hypercubes under the \(\mathrm{MM}^*\) model
- Diagnosability of Two-Matching Composition Networks
- The \(1,2\)-good-neighbor conditional diagnosabilities of regular graphs
- The \(R_g\)-conditional diagnosability of international networks
- Diagnosability of optical multi-mesh hypercube networks under the comparison diagnosis model
- Connectivity for some families of composition networks
- Conditional diagnosability of the round matching composition networks
- Conditional diagnosability of arrangement graphs under the PMC model
- \(r\)-component diagnosability of hypercubes under the PMC model
- Measurement and algorithm for conditional local diagnosis of regular networks under the \(\mathrm{MM}^\ast\) model
- Diagnosability for two families of composition networks
- The \(h\)-edge tolerable diagnosability of balanced hypercubes
- Reliabilities for two kinds of graphs with smaller diameters
- Conditional diagnosability of the \(\mathit{SP}_n\) graphs under the comparison diagnosis model
- Conditional diagnosability of Cayley graphs generated by wheel graphs under the PMC model
- Hybrid fault diagnosis capability analysis of regular graphs
This page was built for publication: Conditional diagnosability of a class of matching composition networks under the comparison model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528473)