A Metaheuristic Approach to the Graceful Labeling Problem of Graphs
A Metaheuristic Approach to the Graceful Labeling Problem of Graphs
复制标题
图优雅标签问题的元启发式方法
DOI：
--
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
K. Eshghi
中科院分区：
文献类型：
--
作者：
H. Mahmoudzadeh;K. Eshghi
本文提出了一种基于蚁群优化的元启发式算法来求解众所周知的图的优美标记问题。尽管关于这个问题的理论发表了大量的论文，但研究人员很少引入一些特殊的技术来优雅地标记图。将该算法应用于多种类型的图，并与文献中已有的方法进行了比较，结果令人满意
In this paper, an algorithm based on ant colony optimization metaheuristic is proposed for finding solutions to the well-known graceful labeling problem of graphs. Despite the large number of papers published on the theory of this problem, there are few particular techniques introduced by researchers for gracefully labeling graphs. The proposed algorithm is applied to many classes of graphs, and the results obtained have proven satisfactory when compared to those of the existing methods in the literature