Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. (Q1401220): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q1199621 |
||
| Property / author | |||
| Property / author: Antoine C. Lobstein / rank | |||
Revision as of 13:01, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. |
scientific article |
Statements
Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. (English)
0 references
17 August 2003
0 references
Complexity
0 references
Coding theory
0 references
Graph
0 references
Identifying code
0 references
Locating-dominating code
0 references
NP-completeness
0 references
