Diagnosis of three types of constant faults in read-once contact networks over finite bases
MetadataShow full item record
AbstractWe study the depth of decision trees for diagnosis of three types of constant faults in read-once contact networks over finite bases containing only indecomposable networks. For each basis and each type of faults, we obtain a linear upper bound on the minimum depth of decision trees depending on the number of edges in networks. For bases containing networks with at most 10 edges, we find sharp coefficients for linear bounds.
CitationDiagnosis of three types of constant faults in read-once contact networks over finite bases 2016 Theoretical Computer Science
SponsorsResearch reported in this publication was supported by the King Abdullah University of Science and Technology (KAUST). The authors are greatly indebted to reviewers for useful comments.
JournalTheoretical Computer Science