Algorithmic complexity of weakly connected Roman domination in graphs (Q5866025)
From MaRDI portal
scientific article; zbMATH DE number 7539626
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic complexity of weakly connected Roman domination in graphs |
scientific article; zbMATH DE number 7539626 |
Statements
Algorithmic complexity of weakly connected Roman domination in graphs (English)
0 references
10 June 2022
0 references
Roman dominating function
0 references
weakly connected Roman domination
0 references
APX-completenes
0 references
integer linear programming
0 references
\(NP\)-completeness
0 references
0 references
0 references
