The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs |
scientific article |
Statements
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (English)
0 references
14 January 2019
0 references
neighborhood
0 references
feedback vertex set
0 references
vertex deletion
0 references
separator
0 references
dominating set
0 references
0 references
0 references
0 references
