Diagnosis of three types of constant faults in read-once contact networks over finite bases
Name:
1-s2.0-S0304397516002346-main.pdf
Size:
384.7Kb
Format:
PDF
Description:
Accepted Manuscript
Type
ArticleKAUST Department
Applied Mathematics and Computational Science ProgramComputer Science Program
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Date
2016-03-24Online Publication Date
2016-03-24Print Publication Date
2016-05Permanent link to this record
http://hdl.handle.net/10754/603716
Metadata
Show full item recordAbstract
We 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.Citation
Diagnosis of three types of constant faults in read-once contact networks over finite bases 2016 Theoretical Computer ScienceSponsors
Research 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.Publisher
Elsevier BVJournal
Theoretical Computer ScienceAdditional Links
http://linkinghub.elsevier.com/retrieve/pii/S0304397516002346ae974a485f413a2113503eed53cd6c53
10.1016/j.tcs.2016.03.023