Loading...

A metaheuristic approach to the graceful labeling problem [electronic resource]

Mahmoudzadeh, H. (Houra) ; Sharif University of Technology

439 Viewed
  1. Type of Document: Article
  2. DOI: 10.4018/jamc.2010100103
  3. Abstract:
  4. 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
  5. Keywords:
  6. Ant colony optimization ; Graceful graphs ; Graph labeling ; Metaheuristic
  7. Source: International Journal of Applied Metaheuristic Computing (IJAMC) ; Volume 1, Issue 4. Copyright © 2010. 15 pages 84-91
  8. URL: http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=4223159&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D4223159