CHECKCOL: Improved local search for graph coloring

13Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

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 simulator to get insights on its cache consciousness: from these experiments, it appears that the algorithm performs substantially less cache misses than other existing algorithms. © 2005 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Caramia, M., Dell’Olmo, P., & Italiano, G. F. (2006). CHECKCOL: Improved local search for graph coloring. Journal of Discrete Algorithms, 4(2), 277–298. https://doi.org/10.1016/j.jda.2005.03.006

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free