Pages that link to "Item:Q6161427"
From MaRDI portal
The following pages link to Algorithmic results in Roman dominating functions on graphs (Q6161427):
Displaying 5 items.
- Nearly tight approximation algorithm for (connected) Roman dominating set (Q2080821) (← links)
- Exact Algorithms for Weak Roman Domination (Q2870018) (← links)
- Algorithmic complexity of weakly connected Roman domination in graphs (Q5866025) (← links)
- Minimal Roman dominating functions: extensions and enumeration (Q6043174) (← links)
- Efficient algorithms for independent Roman domination on some classes of graphs (Q6097713) (← links)
