EURO-DAC '92 Proceedings of the conference on European design automation
Exact coloring of real-life graphs is easy
DAC '97 Proceedings of the 34th annual Design Automation Conference
Evolutionary algorithms for VLSI CAD
Evolutionary algorithms for VLSI CAD
New methods to color the vertices of a graph
Communications of the ACM
Logic Synthesis and Optimization
Logic Synthesis and Optimization
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Minimizing ROBDD Sizes of Incompletely Specified Boolean Functions by Exploiting Strong Symmetries
EDTC '97 Proceedings of the 1997 European conference on Design and Test
Hybrid symbolic-explicit techniques for the graph coloring problem
EDTC '97 Proceedings of the 1997 European conference on Design and Test
On the efficiency of an order-based representation in the clique covering problem
Proceedings of the 14th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
In this paper we present an Evolutionary Algorithm (EA) for the Graph Coloring Problem (GCP). GCP has many important applications in VLSI CAD. The problem in general is known to be NP-hard. Our EA approach incorporates problem specific knowledge, i.e. we make use of different heuristics to obtain efficient solutions. We perform a large set of experiments and compare our EA to state-of-the-art heuristics. It turns out that the combination of EA methods with "classical" heuristics clearly outperforms previous approaches.