Node-and edge-deletion NP-complete problems (Q5402565): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: DBLP publication ID (P1635): conf/stoc/Yannakakis78, #quickstatements; #temporary_batch_1731508824982 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: conf/stoc/Yannakakis78 / rank | |||
Normal rank | |||
Latest revision as of 16:36, 13 November 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
