Please use this identifier to cite or link to this item: https://hdl.handle.net/1959.11/51948
Title: The many facets of upper domination
Contributor(s): Bazgan, Cristina (author); Brankovic, Ljiljana  (author)orcid ; Casel, Katrin (author); Fernau, Henning (author); Jansen, Klaus (author); Klein, Kim-Manuel (author); Lampis, Michael (author); Liedloff, Mathieu (author); Monnot, Jérôme (author); Paschos, Vangelis Th (author)
Publication Date: 2018-03-22
Open Access: Yes
DOI: 10.1016/j.tcs.2017.05.042Open Access Link
Handle Link: https://hdl.handle.net/1959.11/51948
Abstract: 

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.

Publication Type: Conference Publication
Conference Details: AAIM 2016: 11th International Conference on Algorithmic Aspects of Information and Management, Bergamo, Italy, 18th - 20th July, 2016
Source of Publication: Theoretical Computer Science, v.717, p. 2-25
Publisher: Elsevier BV
Place of Publication: Netherlands
ISSN: 1879-2294
0304-3975
Fields of Research (FoR) 2020: 461305 Data structures and algorithms
Socio-Economic Objective (SEO) 2020: 229999 Other information and communication services not elsewhere classified
Peer Reviewed: Yes
HERDC Category Description: E1 Refereed Scholarly Conference Publication
Description: Alternate publication title: Selected papers presented at the 11th International Conference on Algorithmic Aspects of Information and Management (AAIM 2016)
Appears in Collections:Conference Publication
School of Science and Technology

Files in This Item:
2 files
File Description SizeFormat 
Show full item record

SCOPUSTM   
Citations

34
checked on Mar 16, 2024

Page view(s)

862
checked on Mar 8, 2023

Download(s)

8
checked on Mar 8, 2023
Google Media

Google ScholarTM

Check

Altmetric


Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.