Welcome to the InfoSci Platform
Reference Hub1
A Metaheuristic Approach to the Graceful Labeling Problem

A Metaheuristic Approach to the Graceful Labeling Problem

Houra Mahmoudzadeh, Kourosh Eshghi
Copyright: © 2010 |Volume: 1 |Issue: 4 |Pages: 15
ISSN: 1947-8283|EISSN: 1947-8291|EISBN13: 9781613502716|DOI: 10.4018/jamc.2010100103
Cite Article Cite Article

MLA

Mahmoudzadeh, Houra, and Kourosh Eshghi. "A Metaheuristic Approach to the Graceful Labeling Problem." IJAMC vol.1, no.4 2010: pp.42-56. http://doi.org/10.4018/jamc.2010100103

APA

Mahmoudzadeh, H. & Eshghi, K. (2010). A Metaheuristic Approach to the Graceful Labeling Problem. International Journal of Applied Metaheuristic Computing (IJAMC), 1(4), 42-56. http://doi.org/10.4018/jamc.2010100103

Chicago

Mahmoudzadeh, Houra, and Kourosh Eshghi. "A Metaheuristic Approach to the Graceful Labeling Problem," International Journal of Applied Metaheuristic Computing (IJAMC) 1, no.4: 42-56. http://doi.org/10.4018/jamc.2010100103

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.