An algorithm for the minimum dominating set problem based on a new energy function

The dominating set problem asks for a small subset D of nodes in a graph such that every node is either in D or adjacent to a node in D. This article presents an efficient algorithm based on the Hopfield neural network to solve the minimum domination set problem. In the algorithm, in order to help the network find a better solution, we give a new energy function. Extensive simulations were performed, and the results show that the algorithm can get better results than simulated annealing and the traditional Hopfield network for this problem.