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

A Metaheuristic Approach to the Graceful Labeling Problem

Houra Mahmoudzadeh, Kourosh Eshghi
Copyright: © 2012 |Pages: 16
ISBN13: 9781466602700|ISBN10: 1466602708|EISBN13: 9781466602717
DOI: 10.4018/978-1-4666-0270-0.ch013
Cite Chapter Cite Chapter

MLA

Mahmoudzadeh, Houra, and Kourosh Eshghi. "A Metaheuristic Approach to the Graceful Labeling Problem." Modeling, Analysis, and Applications in Metaheuristic Computing: Advancements and Trends, edited by Peng-Yeng Yin, IGI Global, 2012, pp. 217-232. https://doi.org/10.4018/978-1-4666-0270-0.ch013

APA

Mahmoudzadeh, H. & Eshghi, K. (2012). A Metaheuristic Approach to the Graceful Labeling Problem. In P. Yin (Ed.), Modeling, Analysis, and Applications in Metaheuristic Computing: Advancements and Trends (pp. 217-232). IGI Global. https://doi.org/10.4018/978-1-4666-0270-0.ch013

Chicago

Mahmoudzadeh, Houra, and Kourosh Eshghi. "A Metaheuristic Approach to the Graceful Labeling Problem." In Modeling, Analysis, and Applications in Metaheuristic Computing: Advancements and Trends, edited by Peng-Yeng Yin, 217-232. Hershey, PA: IGI Global, 2012. https://doi.org/10.4018/978-1-4666-0270-0.ch013

Export Reference

Mendeley
Favorite

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.