Algorithmic aspects of Roman domination in graphs
From MaRDI portal
Publication:2053064
DOI10.1007/S12190-020-01345-4zbMATH Open1475.05137OpenAlexW3016425788MaRDI QIDQ2053064FDOQ2053064
Authors: Chakradhar Padamutham, Venkata Subba Reddy Palagiri 
Publication date: 29 November 2021
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-020-01345-4
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
Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- A threshold of ln n for approximating set cover
- Introduction to algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimization, approximation, and complexity classes
- Some APX-completeness results for cubic graphs
- Roman domination in graphs.
- Defending the Roman Empire---a new strategy
- Threshold graphs and related topics
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Algorithms and Computation
- Node-and edge-deletion NP-complete problems
- Efficient algorithms for Roman domination on some classes of graphs
- On the Roman domination number of a graph
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- A characterization of Roman trees
- Defending the Roman Empire from multiple attacks
- Counting independent sets in tree convex bipartite graphs
- Roman domination perfect graphs
Cited In (36)
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms
- Double vertex-edge domination in graphs: complexity and algorithms
- Hardness results of global Roman domination in graphs
- Algorithmic aspects of total Roman and total double Roman domination in graphs
- Roman \(k\)-domination: hardness, approximation and parameterized results
- Approximation algorithm for the minimum partial connected Roman dominating set problem
- Complexity issues of perfect Roman domination in graphs
- \(R\)-total domination on convex bipartite 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
- SOFSEM 2006: Theory and Practice of Computer Science
- Independent Roman \(\{3\}\)-domination
- Algorithmic complexity of weakly connected Roman domination in graphs
- Exact Algorithms for Weak Roman Domination
- Algorithmic results for weak Roman domination problem in graphs
- Complexity aspects of variants of independent Roman domination in graphs
- Algorithmic results in Roman dominating functions on graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Unique response Roman domination: complexity and algorithms
- On maximal Roman domination in graphs
- Approximation algorithm for (connected) Italian dominating function
- On the computational complexity aspects of perfect Roman domination
- 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
- Domination problems on \(P_{5}\)-free 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)
