.

A method for the minimum coloring problem using genetic algorithms

LAUR Repository

Show simple item record

dc.contributor.author Harmanani, Haidar
dc.contributor.author Abas, Hani
dc.date.accessioned 2018-04-27T07:44:26Z
dc.date.available 2018-04-27T07:44:26Z
dc.date.copyright 2006 en_US
dc.date.issued 2018-04-27
dc.identifier.uri http://hdl.handle.net/10725/7631
dc.description.abstract This paper presents a method to solve the graph coloring problem for arbitrary graphs using genetic algorithms. The graph coloring problem, an NP-hard problem, has important applications in many areas including time tabling and scheduling, frequency assignment, and reg ister allocation. The algorithm was implemented and tested on various set of instances including large DIMACS challenge benchmark graphs, all yielding favorable results. en_US
dc.language.iso en en_US
dc.publisher Acta Press en_US
dc.title A method for the minimum coloring problem using genetic algorithms en_US
dc.type Conference Paper / Proceeding en_US
dc.author.school SAS en_US
dc.author.idnumber 199490170 en_US
dc.author.department Computer Science and Mathematics en_US
dc.description.embargo N/A en_US
dc.keywords Genetic algorithms en_US
dc.keywords Combinatorial optimization en_US
dc.keywords Graph coloring en_US
dc.identifier.ctation Harmanani, H., & Abas, H. (2006, May). A method for the minimum coloring problem using genetic algorithms. In Proceedings of the 17th IASTED international conference on Modelling and simulation. ACTA Press. en_US
dc.author.email haidar.harmanani@lau.edu.lb en_US
dc.conference.date May 24 – 26, 2006 en_US
dc.conference.pages 487-492 en_US
dc.conference.place Montreal, QC, Canada en_US
dc.conference.subtitle Modelling and Simulation en_US
dc.conference.title Proceedings of the 17th IASTED International conference en_US
dc.identifier.tou http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php en_US
dc.identifier.url http://www.actapress.com/PaperInfo.aspx?PaperID=26827&reason=500 en_US
dc.author.affiliation Lebanese American University en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR


Advanced Search

Browse

My Account