The diagnosability of triangle-free graphs
From MaRDI portal
Publication:2440166
DOI10.1016/j.tcs.2014.02.024zbMath1359.68030OpenAlexW1983599601MaRDI QIDQ2440166
Yuan-Hsiang Teng, Cheng-Kuan Lin
Publication date: 27 March 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.02.024
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (12)
\(g\)-good-neighbor conditional diagnosability measures for 3-ary \(n\)-cube networks ⋮ Diagnosability and hybrid diagnosability of some classes of graphs under the BPMC model ⋮ Conditional diagnosability of the round matching composition networks ⋮ A Local Diagnosis Algorithm for Hypercube-like Networks under the BGM Diagnosis Model ⋮ Relationship between diagnosability and non-inclusive diagnosability of triangle-free connected graphs under the PMC model ⋮ A tree structure for local diagnosis in multiprocessor systems under the comparison model ⋮ Conditional diagnosability of bubble-sort star graphs ⋮ A new measure for locally \(t\)-diagnosable under PMC model ⋮ The Diagnosability of (K4 – {e})-free Graphs under the PMC Diagnosis Model ⋮ A new structure for a vertex to be locally \(t\)-diagnosable in large multiprocessor systems ⋮ Hybrid fault diagnosis capability analysis of triangle-free graphs ⋮ Conditional diagnosability of the \(\mathit{SP}_n\) graphs under the comparison diagnosis model
Cites Work
- The \(g\)-good-neighbor conditional diagnosability of hypercube under PMC model
- An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems
- A group-theoretic model for symmetric interconnection networks
- Characterization of Connection Assignment of Diagnosable Systems
- A Quick Pessimistic Diagnosis Algorithm for Hypercube-Like Multiprocessor Systems under the PMC Model
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
This page was built for publication: The diagnosability of triangle-free graphs