Algorithmic aspects of Roman domination in graphs (Q2053064): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s12190-020-01345-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3016425788 / rank | |||
Normal rank | |||
Revision as of 22:16, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic aspects of Roman domination in graphs |
scientific article |
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
