A Boundary Property for Upper Domination

Hassan M. AbouEisha, Shahid Hussain, Vadim Lozin, Jérôme Monnot, Bernard Ries, Viktor Zamaraev

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations

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.
Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science
PublisherSpringer Nature
Pages229-240
Number of pages12
ISBN (Print)9783319445427
DOIs
StatePublished - Aug 9 2016

Fingerprint Dive into the research topics of 'A Boundary Property for Upper Domination'. Together they form a unique fingerprint.

Cite this