The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342)
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 finding secluded solutions to some classical optimization problems on graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0.8464820981025696
0 references
0.8215718865394592
0 references
0.8171122074127197
0 references
0.7948904037475586
0 references
0.7806617021560669
0 references
