Pages that link to "Item:Q2053064"

The following pages link to Algorithmic aspects of Roman domination in graphs (Q2053064):

Displaying 10 items.

• Algorithmic aspects of total Roman and total double Roman domination in graphs (Q831689) (← links)
• Double vertex-edge domination in graphs: complexity and algorithms (Q2053214) (← links)
• Nearly tight approximation algorithm for (connected) Roman dominating set (Q2080821) (← links)
• Algorithmic aspects of outer independent Roman domination in graphs (Q5101892) (← links)
• Independent roman $\{3\}$-domination (Q5103952) (← links)
• Algorithmic complexity of weakly connected Roman domination in graphs (Q5866025) (← links)
• Unique response Roman domination: complexity and algorithms (Q6088304) (← links)
• Approximation algorithm for (connected) Italian dominating function (Q6090069) (← links)
• Complexity aspects of restrained Roman domination in graphs (Q6132244) (← links)
• Algorithmic results in Roman dominating functions on graphs (Q6161427) (← links)