Node-and edge-deletion NP-complete problems (Q5402565)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6270125
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Node-and edge-deletion NP-complete problems |
scientific article; zbMATH DE number 6270125 |
Statements
Node-and edge-deletion NP-complete problems (English)
0 references
14 March 2014
0 references
approximation
0 references
computational complexity
0 references
edge-deletion
0 references
graph
0 references
graph-property
0 references
hereditary
0 references
maximum subgraph
0 references
NP-complete
0 references
node-deletion
0 references
polynomial hierarchy
0 references
0.9307225
0 references
0.9095981
0 references
0.8917115
0 references
0.89115787
0 references
0.8894609
0 references
0.8893243
0 references
0.88876086
0 references
0.88729185
0 references
0.88349277
0 references
0.88349277
0 references
