DocumentCode
2754915
Title
A Metaheuristic Approach to the Graceful Labeling Problem of Graphs
Author
Mahmoudzadeh, Houra ; Eshghi, Kourosh
Author_Institution
Dept. of Ind. Eng., Sharif Univ. of Technol., Tehran
fYear
2007
fDate
1-5 April 2007
Firstpage
84
Lastpage
91
Abstract
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
Keywords
graph theory; optimisation; ant colony optimization; graceful labeling problem; graphs; metaheuristic approach; Ant colony optimization; Industrial engineering; Labeling; Linear programming; Mathematical programming; Particle swarm optimization; Tree graphs; Wheels; Ant Colony Optimization; Graceful Graphs; Graph Labeling; Metaheuristic;
fLanguage
English
Publisher
ieee
Conference_Titel
Swarm Intelligence Symposium, 2007. SIS 2007. IEEE
Conference_Location
Honolulu, HI
Print_ISBN
1-4244-0708-7
Type
conf
DOI
10.1109/SIS.2007.368030
Filename
4223159
Link To Document