The strong local diagnosability of a hypercube network with missing edges
From MaRDI portal
Publication:1632895
DOI10.1155/2018/5745628zbMath1405.90040OpenAlexW2894807394WikidataQ129140349 ScholiaQ129140349MaRDI QIDQ1632895
Jiarong Liang, Min Xie, Xi Xiong
Publication date: 17 December 2018
Published in: Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2018/5745628
Deterministic network models in operations research (90B10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (2)
Two-round diagnosability measures for multiprocessor systems ⋮ Hybrid fault diagnosis capability analysis of triangle-free graphs
Cites Work
- On the \(t/k\)-diagnosability of BC networks
- Efficient unicast in bijective connection networks with the restricted faulty node set
- A kind of conditional fault tolerance of \((n, k)\)-star graphs
- Edge-pancyclicity and path-embeddability of bijective connection graphs
- A Fast Pessimistic Diagnosis Algorithm for Hypercube-Like Networks under the Comparison Model
- An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems
- Characterization of Connection Assignment of Diagnosable Systems
- Using Node Diagnosability to Determine t-Diagnosability under the Comparison Diagnosis Model
- Reliability Evaluation of BC Networks in Terms of the Extra Vertex- and Edge-Connectivity
- On self-diagnosable multiprocessor systems: diagnosis by the comparison approach
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
This page was built for publication: The strong local diagnosability of a hypercube network with missing edges
