The many facets of upper domination

Author(s)
Bazgan, Cristina
Brankovic, Ljiljana
Casel, Katrin
Fernau, Henning
Jansen, Klaus
Klein, Kim-Manuel
Lampis, Michael
Liedloff, Mathieu
Monnot, Jérôme
Paschos, Vangelis Th
Publication Date
2018-03-22
Abstract
Alternate publication title: Selected papers presented at the 11th International Conference on Algorithmic Aspects of Information and Management (AAIM 2016)
Abstract
<p>This paper studies Upper Domination, i.e., the problem of computing the maximum cardinality of a minimal dominating set in a graph with respect to classical and parameterised complexity as well as approximability.</p>
Citation
Theoretical Computer Science, v.717, p. 2-25
ISSN
1879-2294
0304-3975
Link
https://hdl.handle.net/1959.11/51948
Publisher
Elsevier BV
Title
The many facets of upper domination
Type of document
Conference Publication
Entity Type
Publication

Files:

NameSizeformatDescriptionLink