Giampaolo Luiz Libralão,  Alexandre Claudio Botazzo Delbem. 

Graph modifying problems (GMPs) are present in many application and research areas, mainly in engineering and computation. Lots of alternative approaches have been proposed to deal with the intrinsic complexity existent in these problems, which are, in general, NP-Hard, in which the Evolutionary Algorithms (EAs) had shown to be very promising. Best EAs for GMPs have special data structures (or encodings) to manipulate graphs. In recent researches about GMPs, a relatively new encoding called Node-Depth Encoding (NDE) has presented satisfactory results. In general, recombination operators are able to increase the performance of EAs for GMPs. In this sense, that article proposes a recombination operator for NDE. EA using the existent operators and the proposed one is evaluated for the dc-MST problem.

http://www.lbd.dcc.ufmg.br/colecoes/enia/2005/048.pdf

Processando consulta.