Diagnosis of three types of constant faults in read-once contact networks over finite bases
dc.contributor.author | Busbait, Monther I. | |
dc.contributor.author | Moshkov, Mikhail | |
dc.date.accessioned | 2016-03-27T12:31:15Z | |
dc.date.available | 2016-03-27T12:31:15Z | |
dc.date.issued | 2016-03-24 | |
dc.identifier.citation | Diagnosis of three types of constant faults in read-once contact networks over finite bases 2016 Theoretical Computer Science | |
dc.identifier.issn | 03043975 | |
dc.identifier.doi | 10.1016/j.tcs.2016.03.023 | |
dc.identifier.uri | http://hdl.handle.net/10754/603716 | |
dc.description.abstract | 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. | |
dc.description.sponsorship | 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. | |
dc.language.iso | en | |
dc.publisher | Elsevier BV | |
dc.relation.url | http://linkinghub.elsevier.com/retrieve/pii/S0304397516002346 | |
dc.rights | NOTICE: this is the author’s version of a work that was accepted for publication in Theoretical Computer Science. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Theoretical Computer Science, 24 March 2016. DOI: 10.1016/j.tcs.2016.03.023 | |
dc.subject | Read-once contact networks | |
dc.subject | Constant faults | |
dc.subject | Decision trees | |
dc.title | Diagnosis of three types of constant faults in read-once contact networks over finite bases | |
dc.type | Article | |
dc.contributor.department | Applied Mathematics and Computational Science Program | |
dc.contributor.department | Computer Science Program | |
dc.contributor.department | Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division | |
dc.identifier.journal | Theoretical Computer Science | |
dc.eprint.version | Post-print | |
dc.contributor.affiliation | King Abdullah University of Science and Technology (KAUST) | |
kaust.person | Busbait, Monther I. | |
kaust.person | Moshkov, Mikhail | |
refterms.dateFOA | 2018-03-24T00:00:00Z | |
dc.date.published-online | 2016-03-24 | |
dc.date.published-print | 2016-05 |
Files in this item
This item appears in the following Collection(s)
-
Articles
-
Applied Mathematics and Computational Science Program
For more information visit: https://cemse.kaust.edu.sa/amcs -
Computer Science Program
For more information visit: https://cemse.kaust.edu.sa/cs -
Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division
For more information visit: https://cemse.kaust.edu.sa/