Parameterized and approximation complexity of the detection pair problem in graphs (Q5371038)
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: Parameterized and approximation complexity of the detection pair problem in graphs |
scientific article; zbMATH DE number 6797257
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized and approximation complexity of the detection pair problem in graphs |
scientific article; zbMATH DE number 6797257 |
Statements
Parameterized and approximation complexity of the detection pair problem in graphs (English)
0 references
24 October 2017
0 references
detection pair
0 references
metric dimension
0 references
dominating set
0 references
approximation algorithm
0 references
parameterized complexity
0 references
