Hardness results of global Roman domination in graphs (Q831760)
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: Hardness results of global Roman domination in graphs |
scientific article; zbMATH DE number 7497555
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness results of global Roman domination in graphs |
scientific article; zbMATH DE number 7497555 |
Statements
Hardness results of global Roman domination in graphs (English)
0 references
24 March 2022
0 references
global Roman domination
0 references
NP-complete
0 references
approximation algorithm
0 references
0.9999999
0 references
0 references
0.92954993
0 references
0.92358136
0 references
0.91724974
0 references
0.9123689
0 references
0.9112518
0 references
0.9103278
0 references
0 references
