More results on the complexity of identifying problems in graphs (Q264560): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2016.01.021 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2016.01.021 / rank | |||
Normal rank | |||
Latest revision as of 12:55, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | More results on the complexity of identifying problems in graphs |
scientific article |
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
