Show simple item record

dc.contributor.authorAbouEisha, Hassan M.
dc.contributor.authorHussain, Shahid
dc.contributor.authorLozin, Vadim
dc.contributor.authorMonnot, Jérôme
dc.contributor.authorRies, Bernard
dc.contributor.authorZamaraev, Viktor
dc.date.accessioned2017-01-02T08:10:19Z
dc.date.available2017-01-02T08:10:19Z
dc.date.issued2016-08-09
dc.identifier.citationAbouEisha 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.
dc.identifier.issn0302-9743
dc.identifier.issn1611-3349
dc.identifier.doi10.1007/978-3-319-44543-4_18
dc.identifier.urihttp://hdl.handle.net/10754/622127
dc.description.abstractAn 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.
dc.publisherSpringer Nature
dc.titleA Boundary Property for Upper Domination
dc.typeConference Paper
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentComputer Science Program
dc.identifier.journalLecture Notes in Computer Science
dc.conference.date2016-08-17 to 2016-08-19
dc.conference.name27th International Workshop on Combinatorial Algorithms, IWOCA 2016
dc.conference.locationHelsinki, FIN
dc.contributor.institutionMathematics Institute, University of Warwick, Coventry, United Kingdom
dc.contributor.institutionCNRS, LAMSADE UMR 7243, University Paris-Dauphine, Paris, France
dc.contributor.institutionDepartment of Informatics, University of Fribourg, Bd de P, Fribourg, Switzerland
kaust.personAbouEisha, Hassan M.
kaust.personHussain, Shahid
dc.date.published-online2016-08-09
dc.date.published-print2016


This item appears in the following Collection(s)

Show simple item record