Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540)
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: Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes |
scientific article; zbMATH DE number 6419169
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes |
scientific article; zbMATH DE number 6419169 |
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
0 references
0 references
