Solving minimum dominating set problem based on binary firefly algorithm

One of the central algorithmic graph theory problems is the minimum dominating set (MDS) problem. The MDS has various implementations particularly in graph mining. Various fields such as engineering, physics, social and biological sciences are widely used graph theory.Within the most powerful naturally algorithms are inspired for optimization. The firefly algorithm (FFA) FFA had been successfully used for solving many problems in several fields. This paper introduces FFA for solving the MDS problem. FFA is a general purpose algorithm; however, the problem has to be presented in an appropriate manner to convenient the presented algorithm steps. Hence, binary presentation in this study has been implemented for the MDS problem. Overall, the effectiveness of the presented algorithm experimental results demonstrated over the MDS problem.