Using tabu search techniques for graph coloring

  title={Using tabu search techniques for graph coloring},
  author={Alain Hertz and Dominique de Werra},
Tabu search techniques are used for moving step by step towards the minimum value of a function. A tabu list of forbidden movements is updated during the iterations to avoid cycling and being trapped in local minima. Such techniques are adapted to graph coloring problems. We show that they provide almost optimal colorings of graphs having up to 1000 nodes and their efficiency is shown to be significantly superior to the famous simulated annealing. Tabu-Methoden werden benützt, um schrittweise… CONTINUE READING
Highly Influential
This paper has highly influenced 41 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 648 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 335 extracted citations

Using differential evolution for the graph coloring

2011 IEEE Symposium on Differential Evolution (SDE) • 2011
View 10 Excerpts
Highly Influenced

VColor: A practical vertex-cut based approach for coloring large graphs

2016 IEEE 32nd International Conference on Data Engineering (ICDE) • 2016
View 5 Excerpts
Highly Influenced

648 Citations

Citations per Year
Semantic Scholar estimates that this publication has 648 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-4 of 4 references

Some experiments with simulated annealing for coloring graphs

F. Glover
EJOR • 1987

Interactive decision software and computer graphics for architectural and space planning

A. Johri, D. W. Matula
Annals of Operations Research • 1985

Random graphs of small order . Random graphs ' 83

M. Chains, A. Hertz, D. de Werra
Annals of Discrete Mathematics • 1985

Similar Papers

Loading similar papers…