An iterated greedy algorithm for finding the minimum dominating set in graphs
From MaRDI portal
Publication:6102924
DOI10.1016/j.matcom.2022.12.018OpenAlexW4313367564MaRDI QIDQ6102924
Jesús Sánchez-Oro, Unnamed Author, Sergio Bermudo, A. Casado
Publication date: 26 June 2023
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.matcom.2022.12.018
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scatter search for the bandpass problem
- Dominating communities for hierarchical control of complex networks
- An order-based algorithm for minimum dominating set with application in graph mining
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Experimental analysis of Heuristic algorithms for the dominating set problem
- GRASP and VNS for solving the \(p\)-next center problem
- First vs. best improvement: an empirical study
- Emergence of Scaling in Random Networks
- A measure & conquer approach for the analysis of exact algorithms
- Domination in Graphs Applied to Electric Power Networks
- Automata, Languages and Programming