Skip to main content
Conference Proceedings

A fast and simple local search for graph coloring

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1668 316-329
DOI: 10.1007/3-540-48318-7_25
7Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper a fast and simple local search algorithm for graph coloring is presented. The algorithm is easy to implement and requires the storage of only one solution. Experimental results on bench mark instances of the DIMACS Challenge and on random graphs are given.

Cite

CITATION STYLE

APA

Caramia, M., & DellOlmo, P. (1999). A fast and simple local search for graph coloring. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1668, pp. 316–329). Springer Verlag. https://doi.org/10.1007/3-540-48318-7_25

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