Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. (Q1401220)
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: Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. |
scientific article; zbMATH DE number 1965256
| 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; zbMATH DE number 1965256 |
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
