CHECKCOL: Improved local search for graph coloring

@article{Caramia2006CHECKCOLIL,
  title={CHECKCOL: Improved local search for graph coloring},
  author={Massimiliano Caramia and Paolo Dell'Olmo and Giuseppe F. Italiano},
  journal={J. Discrete Algorithms},
  year={2006},
  volume={4},
  pages={277-298}
}
In this paper we present a novel coloring algorithm based on local search. We analyze its performance, and report several experimental results on DIMACS benchmark graphs. From our experiments, this algorithm looks robust, and yields a substantial speed up on previous algorithms for coloring. Our algorithm improves the best known coloring for four different DIMACS benchmark graphs: namely, Le450-25c, Le450-25d and Flat300_28_0 and Flat1000_76_0. Furthermore, we have run experiments on a… CONTINUE READING
8 Citations
22 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 22 references

P

  • M. Caramia
  • Dell’Olmo, A fast and simple local search for…
  • 1999

Metaheuristics: Theory and Applications

  • I. H. Osman, J. P. Kelley
  • Kluwer Academic, Hingam, MA
  • 1996
1 Excerpt

Scheduling Computer and Manufacturing Processes

  • J. Blazewicz, K. H. Ecker, E. Pesch, G. Schmidt, J. Weglarz
  • Springer, Berlin
  • 1996
1 Excerpt

Similar Papers

Loading similar papers…