Show simple item record

dc.contributor.authorAbouEisha, Hassan M.
dc.contributor.authorHussain, Shahid
dc.contributor.authorLozin, Vadim V.
dc.contributor.authorMonnot, Jérôme
dc.contributor.authorRies, Bernard
dc.date.accessioned2015-08-03T11:44:34Z
dc.date.available2015-08-03T11:44:34Z
dc.date.issued2014-11-13
dc.identifier.issn03029743
dc.identifier.doi10.1007/978-3-319-12691-3_20
dc.identifier.urihttp://hdl.handle.net/10754/563271
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 NP-hard for general graphs and in many restricted graph families. In the present paper, we study the computational complexity of this problem in monogenic classes of graphs (i.e. classes defined by a single forbidden induced subgraph) and show that the problem admits a dichotomy in this family. In particular, we prove that if the only forbidden induced subgraph is a P4 or a 2K2 (or any induced subgraph of these graphs), then the problem can be solved in polynomial time. Otherwise, it is NP-hard.
dc.publisherSpringer Nature
dc.titleA dichotomy for upper domination in monogenic classes
dc.typeArticle
dc.contributor.departmentComputer Science Program
dc.identifier.journalCombinatorial Optimization and Applications
dc.contributor.institutionDIMAP and Mathematics Institute, University of WarwickCoventry, United Kingdom
dc.contributor.institutionPSL, Universit´e Paris-Dauphine, Paris Cedex 16, France
dc.contributor.institutionCNRS, LAMSADE UMRParis, France
kaust.personAbouEisha, Hassan M.
kaust.personHussain, Shahid
dc.date.published-online2014-11-13
dc.date.published-print2014


This item appears in the following Collection(s)

Show simple item record