On the computational complexity of Roman\(\{2\}\)-domination in grid graphs (Q6043333)
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: On the computational complexity of Roman\2\-domination in grid graphs |
scientific article; zbMATH DE number 7682617
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8867480754852295
0 references
0.8860653638839722
0 references
0.8795866370201111
0 references
0.8780162334442139
0 references
0.8766360878944397
0 references
