Algorithmic aspects of Roman {3}-domination in graphs
From MaRDI portal
Publication:5104602
DOI10.1051/RO/2022106zbMath1502.05181OpenAlexW4283018541MaRDI QIDQ5104602
Palagiri Venkata Subba Reddy, Padamutham Chakradhar
Publication date: 15 September 2022
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2022106
NP-completenessAPX-completenessRoman dominating functioninteger linear programming.Roman {3}-domination
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Linear programming (90C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
This page was built for publication: Algorithmic aspects of Roman {3}-domination in graphs