Title
The Diagnosability Of (K-4 - {E})-Free Graphs Under The Pmc Diagnosis Model
Abstract
The ability of identifying all the faulty devices in a multiprocessor system is known as diagnosability. The PMC model is the test-based diagnosis with a processor performing the diagnosis by testing the neighboring processors via the links between them. In this paper, we discuss the diagnosability of a (K-4 - {e})-free graph under the PMC model.
Year
DOI
Venue
2020
10.3233/FI-2020-1985
FUNDAMENTA INFORMATICAE
Keywords
DocType
Volume
system diagnosis, diagnosability, PMC model
Journal
177
Issue
ISSN
Citations 
2
0169-2968
0
PageRank 
References 
Authors
0.34
0
4
Name
Order
Citations
PageRank
Cheng-kuan Lin147646.58
Tzu-Liang Kung200.68
Da-Jin Wang372.11
Yuan-Hsiang Teng401.01