Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Algorithmic aspects of Roman {3}-domination in graphs

From MaRDI portal
Publication:5104602
Jump to:navigation, search

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


zbMATH Keywords

NP-completenessAPX-completenessRoman dominating functioninteger linear programming.Roman {3}-domination


Mathematics Subject Classification ID

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5104602&oldid=19618910"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 13:14.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki