A novel method for computing the minimum spanning tree and solution based on Cellular Neural Networks implemented on digital platforms

We present a novel method for transforming graph theoretical problems into optimization problems and computing the minimum spanning tree (MST) of weighted and undirected graphs. The computing using Cellular Neural Networks (CNN) is considered for ultra-fast solutions when dealing with graphs of complex topology. As proof of concepts of the proposed method, simulations are performed on graphs of magnitude 11 and degree 8. The results obtained show the efficiency of the novel method.