The diagnosability of (K₄-\e\)-free graphs under the PMC diagnosis model
From MaRDI portal
Publication:4988922
DOI10.3233/FI-2020-1985zbMATH Open1497.68051OpenAlexW3115888444MaRDI QIDQ4988922FDOQ4988922
Authors: Cheng-Kuan Lin, Tzu-Liang Kung, Yuan-Hsiang Teng, Dajin Wang
Publication date: 20 May 2021
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2020-1985
Recommendations
- The diagnosability of triangle-free graphs
- Relationship between diagnosability and non-inclusive diagnosability of triangle-free connected graphs under the PMC model
- Conditional diagnosability of component-composition graphs under the PMC model
- Conditional diagnosability of arrangement graphs under the PMC model
- Discrete time optimal adaptive control for linear stochastic systems
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
Cited In (6)
- A Local Diagnosis Algorithm for Hypercube-like Networks under the BGM Diagnosis Model
- Worst-Case Diagnosis Completeness in Regular Graphs under the PMC Model
- Relationship between diagnosability and non-inclusive diagnosability of triangle-free connected graphs under the PMC model
- The diagnosability of triangle-free graphs
- Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model
- Title not available (Why is that?)
This page was built for publication: The diagnosability of \((K_4-\{e\})\)-free graphs under the PMC diagnosis model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4988922)