A Metaheuristic Approach to the Graceful Labeling Problem

Houra Mahmoudzadeh and Kourosh Eshghi
Additional contact information
Houra Mahmoudzadeh: Sharif University of Technology, Iran
Kourosh Eshghi: Sharif University of Technology, Iran

International Journal of Applied Metaheuristic Computing (IJAMC), 2010, vol. 1, issue 4, 42-56

Abstract: In graph theory, a graceful labeling of a graph G = (V, E) with n vertices and m edges is a labeling of its vertices with distinct integers between 0 and m inclusive, such that each edge is uniquely identified by the absolute difference between its endpoints. In this paper, the well-known graceful labeling problem of graphs is represented as an optimization problem, and an algorithm based on Ant Colony Optimization metaheuristic is proposed for finding its solutions. In this regard, the proposed algorithm is applied to different classes of graphs and the results are compared with the few existing methods inside of different literature.

Date: 2010
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 4018/jamc.2010100103 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jamc00:v:1:y:2010:i:4:p:42-56

Access Statistics for this article

International Journal of Applied Metaheuristic Computing (IJAMC) is currently edited by Peng-Yeng Yin

More articles in International Journal of Applied Metaheuristic Computing (IJAMC) from IGI Global
Bibliographic data for series maintained by Journal Editor ().