• Login
    View Item 
    •   Home
    • Research
    • Conference Papers
    • View Item
    •   Home
    • Research
    • Conference Papers
    • 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

    A Boundary Property for Upper Domination

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Conference Paper
    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
    2016-08-09
    Online Publication Date
    2016-08-09
    Print Publication Date
    2016
    Permanent link to this record
    http://hdl.handle.net/10754/622127
    
    Metadata
    Show full item record
    Abstract
    An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of maximum cardinality.The problem of finding an upper dominating set is generally NP-hard, but can be solved in polynomial time in some restricted graph classes, such as P4-free graphs or 2K2-free graphs.For classes defined by finitely many forbidden induced subgraphs, the boundary separating difficult instances of the problem from polynomially solvable ones consists of the so called boundary classes.However, none of such classes has been identified so far for the upper dominating set problem.In the present paper, we discover the first boundary class for this problem.
    Citation
    AbouEisha H, Hussain S, Lozin V, Monnot J, Ries B, et al. (2016) A Boundary Property for Upper Domination. Combinatorial Algorithms: 229–240. Available: http://dx.doi.org/10.1007/978-3-319-44543-4_18.
    Publisher
    Springer Nature
    Journal
    Lecture Notes in Computer Science
    Conference/Event name
    27th International Workshop on Combinatorial Algorithms, IWOCA 2016
    DOI
    10.1007/978-3-319-44543-4_18
    ae974a485f413a2113503eed53cd6c53
    10.1007/978-3-319-44543-4_18
    Scopus Count
    Collections
    Conference Papers; 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.