Node-and edge-deletion NP-complete problems (Q5402565): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1145/800133.804355 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2045027193 / rank | |||
Normal rank |
Latest revision as of 23:02, 19 March 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