The many facets of upper domination.

Bazgan, Cristina, Brankovic, Ljiljana, Casel, Katrin, Fernau, Henning, Jansen, Klaus, Klein, Kim-Manuel, Lampis, Michael, Liedloff, Mathieu, Monnot, Jérôme and Paschos, Vangelis Th. (2018) The many facets of upper domination. Theoretical Computer Science, 717 . pp. 2-25. DOI 10.1016/j.tcs.2017.05.042.

Full text not available from this repository.

Supplementary data:


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.

Document Type: Article
Keywords: ominating set, (In)approximability, Fixed parameter (in)tractability, Extension problems, Bounded-degree graphs
Research affiliation: Kiel University
Kiel University > Kiel Marine Science
OceanRep > The Future Ocean - Cluster of Excellence
Refereed: Yes
Open Access Journal?: No
DOI etc.: 10.1016/j.tcs.2017.05.042
ISSN: 0304-3975
Projects: Future Ocean
Date Deposited: 01 Aug 2018 09:14
Last Modified: 23 Sep 2019 21:45

Actions (login required)

View Item View Item