Worst-Case Diagnosis Completeness in Regular Graphs under the PMC Model

DOI10.1109/TC.2007.1052zbMath1390.68101MaRDI QIDQ4564186

Antonio Caruso, Stefano Chessa, Piero Maestrini

Publication date: 12 June 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

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 (3)

A diagnosis algorithm by using graph-coloring under the PMC model ⋮ Fault isolation and identification in general biswapped networks under the PMC diagnostic model ⋮ The relationship between extra connectivity and conditional diagnosability of regular graphs under the PMC model

This page was built for publication: Worst-Case Diagnosis Completeness in Regular Graphs under the PMC Model