Cart (Loading....) | Create Account
Close category search window

A Metaheuristic Approach to the Graceful Labeling Problem of Graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mahmoudzadeh, H. ; Dept. of Ind. Eng., Sharif Univ. of Technol., Tehran ; Eshghi, K.

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

Published in:

Swarm Intelligence Symposium, 2007. SIS 2007. IEEE

Date of Conference:

1-5 April 2007

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.