A method for the minimum coloring problem using genetic algorithms

Authors:
Haidar Harmanani;Hani Abas
Affiliations:
Department of Computer Science and Mathematics, Lebanese American University, Byblos, Lebanon;Department of Computer Science and Mathematics, Lebanese American University, Byblos, Lebanon
Venue:
MS'06 Proceedings of the 17th IASTED international conference on Modelling and simulation
Year:
2006

Citing 9
Cited 0

Using tabu search techniques for graph coloring

Computing
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
Efficient coloring of a large spectrum of graphs

DAC '98 Proceedings of the 35th annual Design Automation Conference
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Synthesis and Optimization of Digital Circuits

Synthesis and Optimization of Digital Circuits
Iterative Computer Algorithms with Applications in Engineering: Solving Combinatorial Optimization Problems

Iterative Computer Algorithms with Applications in Engineering: Solving Combinatorial Optimization Problems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Sizing Populations for Serial and Parallel Genetic Algorithms

Proceedings of the 3rd International Conference on Genetic Algorithms
Register allocation & spilling via graph coloring

SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction

Quantified Score

Hi-index	0.00

Visualization

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 register allocation. The algorithm was implemented and tested on various set of instances including large DIMACS challenge benchmark graphs, all yielding favorable results.