Percolationby links appliedto the minimum spanning tree problem

This work shows the procedure to optimize the problem of minimum spanning tree applied to percolation by links problem. The aim is improving the structural quality in a complex network by means of a non-directed graph in a square lattice. Moreover, it defines the size of initial population, the number of edges and the running time for each instance of the proposed problem. Experimental results show that proposed algorithm find good quality solutions efficiently for instances of 10, 100, 200,300,400 and 500 vertices. Tackling an instance of 500 vertices for percolation links problem is an important contribution of this research. This work shows the procedure to optimize the problem of minimum spanning tree applied to percolation by links problem. The aim is improving the structural quality in a complex network by means of a non-directed graph in a square lattice. Moreover, it defines the size of initial population, the number of edges and the running time for each instance of the proposed problem. Experimental results show that proposed algorithm find good quality solutions efficiently for instances of 10, 100, 200,300,400 and 500 vertices. Tackling an instance of 500 vertices for percolation links problem is an important contribution of this research.