NP-completeness results for edge modification problems (Q2500532)
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 5047514
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP-completeness results for edge modification problems |
scientific article; zbMATH DE number 5047514 |
Statements
NP-completeness results for edge modification problems (English)
0 references
17 August 2006
0 references
computational complexity
0 references
edge modification problems
0 references
graph classes
0 references
NP-completeness
0 references
0 references
0 references
0.8200763463973999
0 references
0.8121866583824158
0 references
0.803939938545227
0 references
0.7866159081459045
0 references
