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.
Cite
CITATION STYLE
Aboueisha, H., Hussain, S., Lozin, V., Monnot, J., Ries, B., & Zamaraev, V. (2016). A boundary property for upper domination. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9843 LNCS, pp. 229–240). Springer Verlag. https://doi.org/10.1007/978-3-319-44543-4_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
