On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion (Q491619)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
