Recognizing tenacious graphs is NP-hard. (Q5502385)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Recognizing tenacious graphs is NP-hard. |
scientific article; zbMATH DE number 6475962
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recognizing tenacious graphs is NP-hard. |
scientific article; zbMATH DE number 6475962 |
Statements
26 August 2015
0 references
tenacity
0 references
vulnerability
0 references
NP-completeness
0 references
0.8991256952285767
0 references
0.8366326093673706
0 references
0.8241415023803711
0 references
