Algorithmic aspects of Roman domination in graphs
From MaRDI portal
Publication:2053064
Recommendations
- Complexity of Roman \(\{ 2 \} \)-domination and the double Roman domination in graphs
- Algorithmic aspects of Roman \(\{3\}\)-domination in graphs
- Algorithmic results on double Roman domination in graphs
- Algorithmic and complexity aspects of problems related to total Roman domination for graphs
- Complexity issues of perfect Roman domination in graphs
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- A characterization of Roman trees
- A threshold of ln n for approximating set cover
- Algorithms and Computation
- Counting independent sets in tree convex bipartite graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Defending the Roman Empire from multiple attacks
- Defending the Roman Empire---a new strategy
- Efficient algorithms for Roman domination on some classes of graphs
- Introduction to algorithms
- Node-and edge-deletion NP-complete problems
- On the Roman domination number of a graph
- Optimization, approximation, and complexity classes
- Roman domination in graphs.
- Roman domination perfect graphs
- Some APX-completeness results for cubic graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Threshold graphs and related topics
Cited in
(36)- Domination problems on \(P_{5}\)-free graphs
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms
- Double vertex-edge domination in graphs: complexity and algorithms
- Algorithmic aspects of total Roman and total double Roman domination in graphs
- Hardness results of global Roman domination in graphs
- Roman \(k\)-domination: hardness, approximation and parameterized results
- Approximation algorithm for the minimum partial connected Roman dominating set problem
- \(R\)-total domination on convex bipartite graphs
- Complexity issues of perfect Roman domination in graphs
- Roman domination on strongly chordal graphs
- Complexity of Roman \(\{ 2 \} \)-domination and the double Roman domination in graphs
- On maximal Roman domination in graphs: complexity and algorithms
- Efficient algorithms for Roman domination on some classes of graphs
- Algorithmic complexity of triple Roman dominating functions on graphs
- Perfect Italian domination on some generalizations of cographs
- Complexity aspects of restrained Roman domination in graphs
- Independent Roman \(\{3\}\)-domination
- SOFSEM 2006: Theory and Practice of Computer Science
- Exact Algorithms for Weak Roman Domination
- Algorithmic complexity of weakly connected Roman domination in graphs
- Algorithmic results for weak Roman domination problem in graphs
- Complexity aspects of variants of independent Roman domination in graphs
- scientific article; zbMATH DE number 7362655 (Why is no real title available?)
- Algorithmic results in Roman dominating functions on graphs
- scientific article; zbMATH DE number 7693181 (Why is no real title available?)
- Unique response Roman domination: complexity and algorithms
- On maximal Roman domination in graphs
- On the computational complexity aspects of perfect Roman domination
- Approximation algorithm for (connected) Italian dominating function
- Algorithmic aspects of total Roman ${2}$-domination in graphs
- Efficient algorithms for independent Roman domination on some classes of graphs
- Complexity issues concerning the quadruple Roman domination problem in graphs
- Algorithmic aspects of Roman \(\{3\}\)-domination in graphs
- Nearly tight approximation algorithm for (connected) Roman dominating set
- Approximation algorithm for a generalized Roman domination problem in unit ball graphs
- Algorithmic aspects of outer independent Roman domination in graphs
This page was built for publication: Algorithmic aspects of Roman domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053064)
