• Login
    View Item 
    •   Home
    • Research
    • Articles
    • View Item
    •   Home
    • Research
    • Articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

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

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    1-s2.0-S0304397516002346-main.pdf
    Size:
    384.7Kb
    Format:
    PDF
    Description:
    Accepted Manuscript
    Download
    Type
    Article
    Authors
    Busbait, Monther I.
    Moshkov, Mikhail cc
    KAUST Department
    Applied Mathematics and Computational Science Program
    Computer Science Program
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Date
    2016-03-24
    Online Publication Date
    2016-03-24
    Print Publication Date
    2016-05
    Permanent link to this record
    http://hdl.handle.net/10754/603716
    
    Metadata
    Show full item record
    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.
    Citation
    Diagnosis of three types of constant faults in read-once contact networks over finite bases 2016 Theoretical Computer Science
    Sponsors
    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 BV
    Journal
    Theoretical Computer Science
    DOI
    10.1016/j.tcs.2016.03.023
    Additional Links
    http://linkinghub.elsevier.com/retrieve/pii/S0304397516002346
    ae974a485f413a2113503eed53cd6c53
    10.1016/j.tcs.2016.03.023
    Scopus Count
    Collections
    Articles; Applied Mathematics and Computational Science Program; Computer Science Program; Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2023  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.