Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:34, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes |
scientific article |
Statements
Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (English)
0 references
24 March 2015
0 references
test cover
0 references
separating system
0 references
identifying code
0 references
locating-dominating set
0 references
NP-completeness
0 references
approximation
0 references
