Abstract
The double-objective minimum spanning tree problem is an NP-hard problem with important application values in numerous fields such as optical cable communication and intelligent control. An undirected graph is transformed into a factor graph using the restricted Boltzmann machine, and the double-objective minimum spanning tree problem in the undirected graph is mapped into the corresponding problem in the factor graph. To construct the adjacency matrix, several random numbers generated from random number seeds are selected. Moreover, a corresponding undirected graph example is generated. Numerical experimental results indicate that the proposed algorithm is better than other similar algorithms.
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.
