Node-and edge-deletion NP-complete problems (Q5402565): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56209809, #quickstatements; #temporary_batch_1703762337552 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:40, 9 February 2024
scientific article; zbMATH DE number 6270125
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
