Algorithmic aspects of Roman domination in graphs (Q2053064)
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: Algorithmic aspects of Roman domination in graphs |
scientific article; zbMATH DE number 7435125
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic aspects of Roman domination in graphs |
scientific article; zbMATH DE number 7435125 |
Statements
Algorithmic aspects of Roman domination in graphs (English)
0 references
29 November 2021
0 references
Roman domination
0 references
tree convex bipartite graph
0 references
NP-completeness
0 references
APX-complete
0 references
0.919765830039978
0 references
0.9102828502655028
0 references
0.8965842127799988
0 references
0.8896685838699341
0 references
0.884850800037384
0 references
