H. Handa
ABSTRACT
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.
- K. Maezawa and H. Handa, Estimation of Distribution Algorithms with Graph Kernels for Graphs with Node Types, Proc. 20th Asia Pacific Symposium on Intelligent and Evolutionary Systems, pp.251--261 (2016)Google Scholar
- P. Larrañaga, and J.A. Lozano, Estimation of Distribution Algorithms, Kluwer Academic Publishers (2003)Google Scholar
- T. Kitasuka, and M. Iida, A Heuristic Method of Generating Diameter 3 Graphs for Order/Degree Problems, 2016 Tenth IEEE/ACM International Symposium on Networks-on-Chip (2016)Google Scholar
- Graph Golf, http://research.nii.ac.jp/graphgolf/Google Scholar
- H. Kashima, et al., Marginalized Kernels Between Labeled Graphs, Proc. 20th International Conference on Machine Learning (2003) 321--328. Google ScholarDigital Library
- K.M. Borgwardt, and H.-P. Kriegel, Shortest-path kernels on graphs, Proc. 5th International Conference Data Mining (2005) Google ScholarDigital Library
Index Terms
- Solving order/degree problems by using EDA-GK
Recommendations
Investigation of kernel functions in EDA-GK
GECCO '18: Proceedings of the Genetic and Evolutionary Computation Conference CompanionWe have proposed EDA-GK, Estimation of Distribution Algorithms with Graph Kernels. The EDA-GK is designed for solving graph-related problems, where individuals can be represented by graphs. By using graph kernels, the EDA-GK can be solved for graph-...
An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
Let G=(V,E) be a graph. A set S@?V is a restrained dominating set if every vertex in V-S is adjacent to a vertex in S and to a vertex in V-S. The restrained domination number of G, denoted @c"r(G), is the smallest cardinality of a restrained dominating ...
Comments