Solving the minimum-cost double Roman domination problem

DOI10.1007/S10100-023-00884-YMaRDI QIDQ6608515zbMATH OpenFDO

Authors Ana Klobučar Barišić, Robert Manger

Publication date 20 September 2024

Published in CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10100-023-00884-Y

zbMATH Keywords

complexitydominating setdouble Roman dominationdynamic programmingheuristicminimum cost

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Operations research and management science (90Bxx) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Algorithmic results on double Roman domination in graphs
• On the double Roman domination in graphs
• On algorithmic complexity of double Roman domination
• Algorithm and hardness results in double Roman domination of graphs
• Double Roman domination in graphs: algorithmic complexity

Cites work

• Algorithm and hardness results in double Roman domination of graphs
• Algorithmic results on double Roman domination in graphs
• An order-based algorithm for minimum dominating set with application in graph mining
• Complexity of Roman \(\{ 2 \} \)-domination and the double Roman domination in graphs
• Double Roman domination
• Double Roman domination in trees
• Graphs, networks and algorithms.
• Handbook of graph theory
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• On algorithmic complexity of double Roman domination
• On the double Roman domination in graphs
• Properties of double Roman domination on cardinal products of graphs
• Some progress on the double Roman domination in graphs

This page was built for publication: Solving the minimum-cost double Roman domination problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608515)