Algorithm and hardness results in double Roman domination of graphs (Q2118874)
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: Algorithm and hardness results in double Roman domination of graphs |
scientific article; zbMATH DE number 7496387
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithm and hardness results in double Roman domination of graphs |
scientific article; zbMATH DE number 7496387 |
Statements
Algorithm and hardness results in double Roman domination of graphs (English)
0 references
23 March 2022
0 references
double Roman dominating function
0 references
algorithm
0 references
interval graph
0 references
0.9397130012512208
0 references
0.9394292235374452
0 references
0.9286004900932312
0 references
0.9254058599472046
0 references
0.922590970993042
0 references
