The Diagnosability of (K4 – {e})-free Graphs under the PMC Diagnosis Model

DOI10.3233/FI-2020-1985zbMath1497.68051OpenAlexW3115888444MaRDI QIDQ4988922

Yuan-Hsiang Teng, Tzu-Liang Kung, Cheng-Kuan Lin, Da-Jin 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

zbMATH Keywords

diagnosabilityPMC modelsystem diagnosis

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

A Local Diagnosis Algorithm for Hypercube-like Networks under the BGM Diagnosis Model

Cites Work

• The diagnosability of triangle-free graphs
• An 0(n^2.5) Fault Identification Algorithm for Diagnosable Systems
• Characterization of Connection Assignment of Diagnosable Systems
• Optimization of Reduced Dependencies for Synchronous Sequential Machines
• Unnamed Item

This page was built for publication: The Diagnosability of (K4 – {e})-free Graphs under the PMC Diagnosis Model