A study of evaluation functions for the graph K-coloring problem

被引：0

作者：

Porumbel, Daniel Cosmin ^{[1
]}

Hao, Jin-Kao ^{[1
]}

Kuntz, Pascale ^{[2
]}

机构：

[1] Univ Angers, LERIA, 2 Bd Lavoisier, F-49045 Angers 01, France

[2] PolytechNantes, LINA, F-44306 Nantes, France

来源：

ARTIFICIAL EVOLUTION | 2008年 / 4926卷

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The evaluation or fitness function is a key component of any heuristic search algorithm. This paper introduces a new evaluation function for the well-known graph K-coloring problem. This function takes into account not only the number of conflicting vertices, but also inherent information related to the structure of the graph. To assess the effectiveness of this new evaluation function, we carry out a number of experiments using a set of DIMACS benchmark graphs. Based on statistic data obtained with a parameter free steepest descent, we show an improvement of the new evaluation function over the classical one.

引用

页码：124 / +

页数：3

共 50 条

[11] On r-dynamic k-coloring of ladder graph families
Irin Feno, A.
Venkatachalam, M.
Rathour, Laxmi
Cangul, I. N.
Abirami, K.
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2024,
[12] ON THE K-COLORING OF INTERVALS
CARLISLE, MC
LLOYD, EL
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 497 : 90 - 101
[13] ON THE K-COLORING OF INTERVALS
CARLISLE, MC
LLOYD, EL
DISCRETE APPLIED MATHEMATICS, 1995, 59 (03) : 225 - 235
[14] Grobner bases techniques for an S-packing k-coloring of a graph
Maarouf, Hamid
ELECTRONIC JOURNAL OF COMBINATORICS, 2017, 24 (03):
[15] On the probabilistic minimum coloring and minimum k-coloring
Murat, U
Paschos, VT
DISCRETE APPLIED MATHEMATICS, 2006, 154 (03) : 564 - 586
[16] The k-coloring fitness landscape
Hend Bouziri
Khaled Mellouli
El-Ghazali Talbi
Journal of Combinatorial Optimization, 2011, 21 : 306 - 329
[17] The k-coloring fitness landscape
Bouziri, Hend
Mellouli, Khaled
Talbi, El-Ghazali
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2011, 21 (03) : 306 - 329
[18] BALANCED K-COLORING OF POLYOMINOS
TAKAHASHI, T
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1994, E77A (03) : 517 - 520
[19] An improved transiently chaotic neural network for solving the K-coloring problem
Gu, SS
ADVANCES IN NEURAL NETWORKS - ISNN 2005, PT 1, PROCEEDINGS, 2005, 3496 : 750 - 755
[20] Nonconvex Quadratic Programming Method for k－Coloring Problem：Algorithm and Computation
Cao Jiaming(Department of Transportation Engineering)
Railway Engineering Science, 1994, (02) : 138 - 145

← 1 2 3 4 5 →