Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
