Pages that link to "Item:Q326504"

The following pages link to A diagnosis algorithm by using graph-coloring under the PMC model (Q326504):

Displaying 8 items.

• Diagnosability and hybrid diagnosability of some classes of graphs under the BPMC model (Q2143120) (← links)
• A graph theory-based approach to the description of the process and the diagnostic system (Q2162135) (← links)
• Symmetric PMC model of diagnosis, \(b\)-matchings in graphs and fault identification in \(t\)-diagnosable systems (Q2235745) (← links)
• Relationship between diagnosability and non-inclusive diagnosability of triangle-free connected graphs under the PMC model (Q2680179) (← links)
• Worst-Case Diagnosis Completeness in Regular Graphs under the PMC Model (Q4564186) (← links)
• The \(t/k\)-diagnosability of \(m\)-ary \(n\)-cube networks (Q6138838) (← links)
• The non-inclusive diagnosability of regular graphs (Q6151011) (← links)
• The non-inclusion diagnosability of hypercubes under the PMC model (Q6566790) (← links)