On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion (Q491619)
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: On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion |
scientific article |
Statements
On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion (English)
0 references
18 August 2015
0 references
node deletion problems
0 references
approximation algorithm
0 references
hardness of approximation
0 references
0 references
0 references
0.7840200066566467
0 references
0.781721830368042
0 references
0.7757560610771179
0 references
0.7729570269584656
0 references
0.7642858624458313
0 references
