Pages that link to "Item:Q2197468"
From MaRDI portal
The following pages link to On algorithmic complexity of double Roman domination (Q2197468):
Displaying 11 items.
- Some progress on the double Roman domination in graphs (Q1630922) (← links)
- Algorithm and hardness results in double Roman domination of graphs (Q2118874) (← links)
- Maximal double Roman domination in graphs (Q2247105) (← links)
- Algorithmic results on double Roman domination in graphs (Q2292130) (← links)
- Algorithmic and complexity aspects of problems related to total Roman domination for graphs (Q2307496) (← links)
- On the double Roman domination in graphs (Q2410217) (← links)
- Varieties of Roman Domination (Q3384116) (← links)
- (Q4957549) (← links)
- (Q6149323) (← links)
- Solving the minimum-cost double Roman domination problem (Q6608515) (← links)
- The \(k\)-th Roman domination problem is polynomial on interval graphs (Q6646735) (← links)