Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. (Q1401220): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(02)00536-4 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1967536892 / rank | |||
Normal rank |
Latest revision as of 09:58, 30 July 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