Diagnosis of constant faults in read-once contact networks over finite bases

Monther I. Busbait, Igor Chikalov, Shahid Hussain, Mikhail Moshkov

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

We study the depth of decision trees for diagnosis of constant 0 and 1 faults in read-once contact networks over finite bases containing only indecomposable networks. For each basis, we obtain a linear upper bound on the minimum depth of decision trees depending on the number of edges in the networks. For bases containing networks with at most 10 edges we find coefficients for linear bounds which are close to sharp. © 2014 Elsevier B.V. All rights reserved.
Original languageEnglish (US)
Pages (from-to)76-88
Number of pages13
JournalDiscrete Applied Mathematics
Volume184
DOIs
StatePublished - Mar 2015

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Diagnosis of constant faults in read-once contact networks over finite bases'. Together they form a unique fingerprint.

Cite this