| Title |
|
The many facets of upper domination |
|
|
| Publication Date |
|
| Author(s) |
|
| Editor |
|
Editor(s): Riccardo Dondi, Guillaume Fertin and Giancarlo Mauri |
|
|
| Abstract |
|
Alternate publication title: Selected papers presented at the 11th International Conference on Algorithmic Aspects of Information and Management (AAIM 2016) |
|
|
| Type of document |
|
| Language |
|
| Entity Type |
|
| Publisher |
|
| Place of publication |
|
| DOI |
|
10.1016/j.tcs.2017.05.042 |
|
|
| UNE publication id |
|
| 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. |
|
|
| Link |
|
| Citation |
|
Theoretical Computer Science, v.717, p. 2-25 |
|
|
| ISSN |
|
| Start page |
|
| End page |
|