Unique response Roman domination: complexity and algorithms
From MaRDI portal
Publication:6088304
Cites work
- A Greedy Heuristic for the Set-Covering Problem
- A linear time recognition algorithm for proper interval graphs
- A note on Roman domination of digraphs
- A unified approach to domination problems on interval graphs
- Algorithm and hardness results in double Roman domination of graphs
- Algorithmic aspects of Roman domination in graphs
- Algorithmic results on double Roman domination in graphs
- Analytical approach to parallel repetition
- Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs
- Completely separable graphs
- Complexity of Roman \(\{ 2 \} \)-domination and the double Roman domination in graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Distance-hereditary graphs
- Distance-hereditary graphs are clique-perfect
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
- Dominating sets for split and bipartite graphs
- Domination in permutation graphs
- Double Roman domination
- Double Roman domination in trees
- Efficient algorithms for Roman domination on some classes of graphs
- Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
- Graph Classes: A Survey
- Homogeneous sets and domination: A linear time algorithm for distance-hereditary graphs
- scientific article; zbMATH DE number 4152428 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- Italian domination in trees
- On the double Roman domination of graphs
- Outer independent double Roman domination
- Outer independent Roman dominating functions in graphs
- Paired-domination problem on distance-hereditary graphs
- Perfect Italian domination in cographs
- Perfect Italian domination in graphs: complexity and algorithms
- Perfect Italian domination in trees
- Perfect Roman domination in graphs
- Perfect Roman domination in trees
- Roman \(\{2 \}\)-domination
- Roman dominating influence parameters
- Roman domination in graphs.
- Signed Roman domination in graphs
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- The complexity of theorem-proving procedures
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- The unique response Roman domination in trees
- Trees with strong equality between the roman domination number and the unique response Roman domination number
- Unique response Roman domination in graphs
- Weighted connected domination and Steiner trees in distance-hereditary graphs
Cited in
(2)
This page was built for publication: Unique response Roman domination: complexity and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6088304)
