On the computational complexity of Roman\(\{2\}\)-domination in grid graphs (Q6043333): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-023-01024-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4365518251 / rank | |||
Normal rank | |||
Revision as of 10:09, 30 July 2024
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
