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 benchmark instances of the DIMACS Challenge and on random graphs are given.
A Fast and Simple Local Search for Graph Coloring / Caramia, M.; Dell'Olmo, Paolo. - STAMPA. - 1668:(1999), pp. 316-329.
A Fast and Simple Local Search for Graph Coloring
DELL'OLMO, Paolo
1999
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 benchmark instances of the DIMACS Challenge and on random graphs are given.File allegati a questo prodotto
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
