Upper Domination: Towards a Dichotomy Through Boundary Properties
AuthorsAbouEisha, Hassan M.
KAUST DepartmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Computer Science Program
Online Publication Date2017-07-14
Print Publication Date2018-10
Permanent link to this recordhttp://hdl.handle.net/10754/625686
MetadataShow full item record
AbstractAn 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.
CitationAbouEisha 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.
SponsorsVadim 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.