Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. (Q1401220): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4023377 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2717197 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3789614 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4368728 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a new class of codes for identifying vertices in graphs / rank | |||
Normal rank |
Revision as of 09:47, 6 June 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