A method for the minimum coloring problem using genetic algorithms
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 algorith...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | conferenceObject |
| Published: |
2006
|
| Online Access: | http://hdl.handle.net/10725/7631 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php http://www.actapress.com/PaperInfo.aspx?PaperID=26827&reason=500 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1864513482673618945 |
|---|---|
| author | Harmanani, Haidar |
| author2 | Abas, Hani |
| author2_role | author |
| author_facet | Harmanani, Haidar Abas, Hani |
| author_role | author |
| dc.creator.none.fl_str_mv | Harmanani, Haidar Abas, Hani |
| dc.date.none.fl_str_mv | 2006 2018-04-27T07:44:26Z 2018-04-27T07:44:26Z 2018-04-27 |
| dc.identifier.none.fl_str_mv | http://hdl.handle.net/10725/7631 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. http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php http://www.actapress.com/PaperInfo.aspx?PaperID=26827&reason=500 |
| dc.language.none.fl_str_mv | en |
| dc.publisher.none.fl_str_mv | Acta Press |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.title.none.fl_str_mv | A method for the minimum coloring problem using genetic algorithms |
| dc.type.none.fl_str_mv | Conference Paper / Proceeding info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/conferenceObject |
| description | 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. |
| eu_rights_str_mv | openAccess |
| format | conferenceObject |
| id | LAURepo_193bf3266ab81c21343bb8ff6aa4e359 |
| identifier_str_mv | 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. |
| language_invalid_str_mv | en |
| network_acronym_str | LAURepo |
| network_name_str | Lebanese American University repository |
| oai_identifier_str | oai:laur.lau.edu.lb:10725/7631 |
| publishDate | 2006 |
| publisher.none.fl_str_mv | Acta Press |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | A method for the minimum coloring problem using genetic algorithmsHarmanani, HaidarAbas, HaniThis 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.N/AActa Press2018-04-27T07:44:26Z2018-04-27T07:44:26Z20062018-04-27Conference Paper / Proceedinginfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObjecthttp://hdl.handle.net/10725/7631Harmanani, 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.http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.phphttp://www.actapress.com/PaperInfo.aspx?PaperID=26827&reason=500eninfo:eu-repo/semantics/openAccessoai:laur.lau.edu.lb:10725/76312021-03-19T10:43:19Z |
| spellingShingle | A method for the minimum coloring problem using genetic algorithms Harmanani, Haidar |
| status_str | publishedVersion |
| title | A method for the minimum coloring problem using genetic algorithms |
| title_full | A method for the minimum coloring problem using genetic algorithms |
| title_fullStr | A method for the minimum coloring problem using genetic algorithms |
| title_full_unstemmed | A method for the minimum coloring problem using genetic algorithms |
| title_short | A method for the minimum coloring problem using genetic algorithms |
| title_sort | A method for the minimum coloring problem using genetic algorithms |
| url | http://hdl.handle.net/10725/7631 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php http://www.actapress.com/PaperInfo.aspx?PaperID=26827&reason=500 |