More results on the complexity of identifying problems in graphs (Q264560)
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: More results on the complexity of identifying problems in graphs |
scientific article; zbMATH DE number 6561609
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | More results on the complexity of identifying problems in graphs |
scientific article; zbMATH DE number 6561609 |
Statements
More results on the complexity of identifying problems in graphs (English)
0 references
31 March 2016
0 references
graph theory
0 references
complexity classes
0 references
polynomial hierarchy
0 references
NP-completeness
0 references
hardness
0 references
identifying codes
0 references
twin-free graphs
0 references
0 references
0 references
0 references
0.849504828453064
0 references
0.8356057405471802
0 references
0.8277360200881958
0 references
0.8271700143814087
0 references
0.8211978673934937
0 references
