On the algorithmic complexity of Roman \(\{2\}\)-domination (Italian domination) (Q7232198)
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 8189456
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the algorithmic complexity of Roman \(\{2\}\)-domination (Italian domination) |
scientific article; zbMATH DE number 8189456 |
Statements
On the algorithmic complexity of Roman \(\{2\}\)-domination (Italian domination) (English)
0 references
22 April 2026
0 references
Roman \(\{2\}\)-dominating function
0 references
algorithm
0 references
3-SAT
0 references
planar 3-SAT problem
0 references
