Algorithmic results on double Roman domination in graphs
From MaRDI portal
Recommendations
- On algorithmic complexity of double Roman domination
- On the double Roman domination in graphs
- A linear algorithm for double Roman domination of proper interval graphs
- Some progress on the double Roman domination in graphs
- Complexity of Roman \(\{ 2 \} \)-domination and the double Roman domination in graphs
Cites work
- A characterization of double Roman trees
- A Greedy Heuristic for the Set-Covering Problem
- A linear time recognition algorithm for proper interval graphs
- An upper bound on the double Roman domination number
- Analytical approach to parallel repetition
- Characterization of double Roman trees.
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Defending the Roman Empire---a new strategy
- Double Roman domination
- Double Roman domination and domatic numbers of graphs
- Double Roman domination in trees
- Double Roman domination number
- Global double Roman domination in graphs
- scientific article; zbMATH DE number 4152428 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- On the double Roman domination in graphs
- On the double Roman domination of graphs
- Roman \(\{2 \}\)-domination
- Roman domination in graphs.
- Signed double Roman domination in graphs
- Signed Roman domination in graphs
- Some progress on the double Roman domination in graphs
- The complexity of domination problems in circle graphs
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- The weighted perfect domination problem and its variants
Cited in
(24)- Some progress on the double Roman domination in graphs
- Algorithmic aspects of Roman domination in graphs
- Algorithm and hardness results in double Roman domination of graphs
- Double Roman domination in generalized Petersen graphs
- Perfect Italian domination in graphs: complexity and algorithms
- A linear-time algorithm for weighted paired-domination on block graphs
- On algorithmic complexity of double Roman domination
- On the double Roman domination in graphs
- Complexity of Roman \(\{ 2 \} \)-domination and the double Roman domination in graphs
- Integer linear programming formulations for double Roman domination problem
- A linear algorithm for double Roman domination of proper interval graphs
- Unique response Roman domination: complexity and algorithms
- Algorithmic aspects of total Roman ${2}$-domination in graphs
- Perfect double Roman domination in graphs
- Double Roman domination in graphs: algorithmic complexity
- Algorithmic complexity of triple Roman dominating functions on graphs
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms
- Solving the minimum-cost double Roman domination problem
- Algorithmic results for weak Roman domination problem in graphs
- The k-th Roman domination problem is polynomial on interval graphs
- Extension perfect Roman domination
- Bounds on the total double Roman domination number of graphs
- Perfect Roman domination: aspects of enumeration and parameterization
- Hardness and algorithmic results for Roman \{3\}-domination
This page was built for publication: Algorithmic results on double Roman domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292130)
