• 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

    Upper Domination: Towards a Dichotomy Through Boundary Properties

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Article
    Authors
    AbouEisha, Hassan M. cc
    Hussain, Shahid cc
    Lozin, Vadim
    Monnot, Jérôme
    Ries, Bernard
    Zamaraev, Viktor cc
    KAUST Department
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Computer Science Program
    Date
    2017-07-14
    Online Publication Date
    2017-07-14
    Print Publication Date
    2018-10
    Permanent link to this record
    http://hdl.handle.net/10754/625686
    
    Metadata
    Show full item record
    Abstract
    An upper dominating set in a graph is a minimal dominating set of maximum cardinality. The problem of finding an upper dominating set is generally NP-hard. We study the complexity of this problem in finitely defined classes of graphs and conjecture that the problem admits a complexity dichotomy in this family. A helpful tool to study the complexity of an algorithmic problem is the notion of boundary classes. However, none of such classes has been identified so far for the upper dominating set problem. We discover the first boundary class for this problem and prove the dichotomy for monogenic classes.
    Citation
    AbouEisha H, Hussain S, Lozin V, Monnot J, Ries B, et al. (2017) Upper Domination: Towards a Dichotomy Through Boundary Properties. Algorithmica. Available: http://dx.doi.org/10.1007/s00453-017-0346-9.
    Sponsors
    Vadim Lozin and Viktor Zamaraev gratefully acknowledge support from EPSRC, Grant EP/L020408/1. Part of this research was carried out when Vadim Lozin was visiting the King Abdullah University of Science and Technology (KAUST). This author thanks the University for hospitality and stimulating research environment.
    Publisher
    Springer Nature
    Journal
    Algorithmica
    DOI
    10.1007/s00453-017-0346-9
    arXiv
    1609.01510
    Additional Links
    http://link.springer.com/article/10.1007/s00453-017-0346-9
    ae974a485f413a2113503eed53cd6c53
    10.1007/s00453-017-0346-9
    Scopus Count
    Collections
    Articles; 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.