Pages that link to "Item:Q2053064"
From MaRDI portal
The following pages link to Algorithmic aspects of Roman domination in graphs (Q2053064):
Displaying 25 items.
- Roman domination on strongly chordal graphs (Q385486) (← links)
- Algorithmic aspects of total Roman and total double Roman domination in graphs (Q831689) (← links)
- Efficient algorithms for Roman domination on some classes of graphs (Q1003729) (← links)
- Double vertex-edge domination in graphs: complexity and algorithms (Q2053214) (← links)
- Nearly tight approximation algorithm for (connected) Roman dominating set (Q2080821) (← links)
- Approximation algorithm for a generalized Roman domination problem in unit ball graphs (Q2292134) (← links)
- Complexity aspects of variants of independent Roman domination in graphs (Q2666348) (← links)
- Exact Algorithms for Weak Roman Domination (Q2870018) (← links)
- \(R\)-total domination on convex bipartite graphs (Q2906273) (← links)
- (Q4995292) (← links)
- On the computational complexity aspects of perfect Roman domination (Q5046034) (← links)
- Algorithmic aspects of outer independent Roman domination in graphs (Q5101892) (← links)
- Independent roman $\{3\}$-domination (Q5103952) (← links)
- Domination problems on P<sub>5</sub>-free graphs (Q5248877) (← 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)
- Efficient algorithms for independent Roman domination on some classes of graphs (Q6097713) (← links)
- Algorithmic aspects of total Roman ${2}$-domination in graphs (Q6101489) (← links)
- Complexity aspects of restrained Roman domination in graphs (Q6132244) (← links)
- (Q6155858) (← links)
- Algorithmic results in Roman dominating functions on graphs (Q6161427) (← links)
- Approximation algorithm for the minimum partial connected Roman dominating set problem (Q6571270) (← links)
- On maximal Roman domination in graphs: complexity and algorithms (Q6593946) (← links)
- Perfect Italian domination on some generalizations of cographs (Q6616154) (← links)
