On the computational complexity of Roman\(\{2\}\)-domination in grid graphs (Q6043333)
From MaRDI portal
scientific article; zbMATH DE number 7682617
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of Roman\(\{2\}\)-domination in grid graphs |
scientific article; zbMATH DE number 7682617 |
Statements
On the computational complexity of Roman\(\{2\}\)-domination in grid graphs (English)
0 references
5 May 2023
0 references
computational complexity
0 references
Roman\(\{2\}\)-domination
0 references
APX-hardness
0 references
grid graphs
0 references
