Algorithmic Aspects of Upper Domination
Computational Complexity
2015-06-25 v1
Abstract
In this paper we study combinatorial and algorithmic resp. complexity questions of upper domination, i.e., the maximum cardinality of a minimal dominating set in a graph. We give a full classification of the related maximisation and minimisation problems, as well as the related parameterised problems, on general graphs and on graphs of bounded degree, and we also study planar graphs.
Cite
@article{arxiv.1506.07260,
title = {Algorithmic Aspects of Upper Domination},
author = {Cristina Bazgan and Ljiljana Brankovic and Katrin Casel and Henning Fernau and Klaus Jansen and Michael Lampis and Mathieu Liedloff and Jérôme Monnot and Vangelis Th. Paschos},
journal= {arXiv preprint arXiv:1506.07260},
year = {2015}
}