EDP Sciences logo
Subscriber Authentication Point
Sciengine logo
Search
Menu
All issues Volume 59 (2025) RAIRO-Theor. Inf. Appl., 59 (2025) 6 References
Open Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 59, 2025
Article Number 6
Number of page(s) 22
DOI https://doi.org/10.1051/ita/2025006
Published online 29 August 2025
  1. D.B. West et al., Introduction to Graph Theory, vol. 2. Prentice hall Upper Saddle River (2001). [Google Scholar]
  2. T.W. Haynes, S. Hedetniemi and P. Slater, Fundamentals of Domination in Graphs. CRC Press (2013). [Google Scholar]
  3. E.J. Cockayne, P.A. Dreyer Jr, S.M. Hedetniemi and S.T. Hedetniemi, Roman domination in graphs. Discrete Math. 278 (2004) 11–22. [CrossRef] [MathSciNet] [Google Scholar]
  4. G. Hao, L. Volkmann and D.A. Mojdeh, Total double roman domination in Graphs. Commun. Comb. Optim. 5 (2020) 27–39. [Google Scholar]
  5. S. Kosari, S. Babaei, J. Amjadi, M. Chellali and S. Sheikholeslami, Quasi total double roman domination in graphs. AKCE Int. J. Graphs Comb. 21 (2024) 171–180. [Google Scholar]
  6. A. Khandelwal, K. Srivastava and G. Saran, On roman domination of graphs using a genetic algorithm, in Computational Methods and Data Engineering: Proc. of ICMDE 2020, vol. 1. Springer (2020) 133–147. [Google Scholar]
  7. J. Greilhuber, S. Schober, E. Iurlano and G.R. Raidl, A simulated annealing based approach for the roman domination problem, in International Conference on Metaheuristics and Nature Inspired Computing. Springer (2023) 28–43. [Google Scholar]
  8. R.S. Banovoth and K. Kadambari, Roman domination-based spiking neural network for optimized eeg signal classification of four class motor imagery. Comput. Biol. Med. 194 (2025) 110397. [Google Scholar]
  9. S.N. Chaurasia and A. Singh, A hybrid evolutionary algorithm with guided mutation for minimum weight dominating set. Appl. Intell. 43 (2015) 512–529. [Google Scholar]
  10. H. Aggarwal and P.V.S. Reddy, Meta-heuristic algorithms for double roman domination problem. Appl. Soft Comput. 154 (2024) 111306. [Google Scholar]
  11. M.A. Raju and P.V.S. Reddy, Metaheuristic algorithms for solving roman (2)-domination problem. RAIRO Oper. Res. 58 (2024) 2107–2121. [Google Scholar]
  12. J.H. Holland, Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975). [Google Scholar]
  13. D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA (1989). [Google Scholar]
  14. M. Mitchell, An Introduction to Genetic Algorithms. MIT Press, Cambridge, MA (1996). [Google Scholar]
  15. D. Karaboga and B. Basturk, A powerful and efficient algorithm for numerical function optimization: artificial bee colony (abc) algorithm. J. Global Optim. 39 (2007) 459–471. [Google Scholar]
  16. B. Akay and D. Karaboga, A Modified Artificial Bee Colony Algorithm for Real-Parameter Optimization. Elsevier (2012). [Google Scholar]
  17. W. Gao and S. Liu, Improved Artificial Bee Colony Algorithm for Global Optimization. Elsevier (2013). [Google Scholar]
  18. I.S. Duff, R.G. Grimes and J.G. Lewis, Sparse matrix test problems. ACM Trans. Math. Softw. 15 (1989) 1–14. [Google Scholar]
  19. I.S. Duff, R.G. Grimes and J.G. Lewis, Users’ guide for the Harwell-Boeing sparse matrix collection (release I). Tech. Rep. RAL-92-086. Rutherford Appleton Laboratory (1992). [Google Scholar]
  20. A.-L. Barabási and R. Albert, Emergence of scaling in random networks. Science 286 (1999) 509–512. [CrossRef] [MathSciNet] [PubMed] [Google Scholar]
  21. R. Albert and A.-L. Barabási, Statistical mechanics of complex networks. Rev. Mod. Phys. 74 (2002) 47–97. [CrossRef] [Google Scholar]
  22. P. Erdős and A. Rényi, On random graphs I. Publ. Math. Debrecen 6 (1959) 290–297. [Google Scholar]
  23. B. Bollobás, Random Graphs, 2nd edn. Cambridge University Press (2001). [Google Scholar]
  24. D.J. Watts and S.H. Strogatz, Collective dynamics of ‘small-world’ Networks. Nature 393 (1998) 440–442. [NASA ADS] [CrossRef] [PubMed] [Google Scholar]
  25. M.E.J. Newman, The structure and function of complex networks. SIAM Rev. 45 (2003) 167–256. [CrossRef] [MathSciNet] [Google Scholar]
  26. J. Kleinberg, Navigation in a small world. Nature 406 (2000) 845. [Google Scholar]
  27. J. Kleinberg, Complex networks and decentralized search algorithms. Proc. Int. Congress Math. 3 (2006) 1019–1044. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.