Complexity of Roman \(\{ 2 \} \)-domination and the double Roman domination in graphs (Q4956233)
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: Complexity of Roman \ 2 \ -domination and the double Roman domination in graphs |
scientific article; zbMATH DE number 7389455
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of Roman \(\{ 2 \} \)-domination and the double Roman domination in graphs |
scientific article; zbMATH DE number 7389455 |
Statements
Complexity of Roman {2}-domination and the double Roman domination in graphs (English)
0 references
1 September 2021
0 references
Roman \(\{ 2 \} \)-domination
0 references
double Roman domination
0 references
tree convex bipartite graphs
0 references
NP-complete
0 references
approximation algorithm
0 references
0.919765830039978
0 references
0.9106146693229676
0 references
0.9073464274406432
0 references
0.9044545888900756
0 references
0.901401937007904
0 references
