On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs (Q786037)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7233375
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs |
scientific article; zbMATH DE number 7233375 |
Statements
On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs (English)
0 references
12 August 2020
0 references
identifying code
0 references
resolving set
0 references
metric dimension
0 references
distance-identifying set
0 references
parameterized complexity
0 references
W-hierarchy
0 references
meta-problem
0 references
hitting set
0 references
0 references
0.992380917072296
0 references
0.798177182674408
0 references
0.7969338297843933
0 references
0.7848790287971497
0 references
