Meta-heuristic algorithms for quasi total double Roman domination problem

DOI10.1051/ITA/2025006MaRDI QIDQ6935845zbMATH OpenFDO

Authors Charan Karnati, Alfred Raju M., Palagiri Venkata Subba Reddy

Publication date 2 September 2025

Published in RAIRO. Theoretical Informatics and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/ITA/2025006

zbMATH Keywords

artificial bee colony algorithmgenetic algorithmNP-hardnessquasi total double Roman dominationRoman domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
• Collective dynamics of `small-world' networks
• Complex networks and decentralized search algorithms
• Emergence of Scaling in Random Networks
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• Metaheuristic algorithms for solving Roman \(\{2\}\)-domination problem
• Quasi total double Roman domination in graphs
• Random graphs.
• Roman domination in graphs.
• Sparse matrix test problems
• Statistical mechanics of complex networks
• The Structure and Function of Complex Networks
• Total double Roman domination in graphs

This page was built for publication: Meta-heuristic algorithms for quasi total double Roman domination problem

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