Solving order/degree problems by using EDA-GK
Hisashi Handa, Ryoischi Hasegawa · Proceedings of the Genetic and Evolutionary Computation Conference Companion · 2017
The1 Estimation of Distribution Algorithms with Graph Kernels called EDA-GK is an extension of the Estimation of Distribution Algorithms to cope with graph-related problems. The individuals of the EDA-GK are represented by graphs. In this paper, the EDA-GK is applied to solve for the Order/Degree problems, which are an NP-hard problem and are a benchmark problem in graph theory studies. Experimental results on several problem instances on the Order/Degree problems show the effectiveness of the EDA-GK.