Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jda.2014.08.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1973765739 / rank | |||
Normal rank | |||
Revision as of 02:12, 20 March 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
