Referenced Items are not available for this document.
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
- Page(s):
- 84 - 91
- Print ISBN:
- 1-4244-0708-7
- INSPEC Accession Number:
- 9507056
- Conference Location :
- Honolulu, HI
- Digital Object Identifier :
- 10.1109/SIS.2007.368030
- Product Type:
- Conference Publications
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
