The parameterized complexity of dominating set and friends revisited for structured graphs (Q2330569)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The parameterized complexity of dominating set and friends revisited for structured graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The parameterized complexity of dominating set and friends revisited for structured graphs |
scientific article |
Statements
The parameterized complexity of dominating set and friends revisited for structured graphs (English)
0 references
22 October 2019
0 references
dominating set
0 references
efficient domination
0 references
FPT
0 references
kernelization
0 references
W-hardness
0 references
structural parameters
0 references
