A Fast and Simple Local Search for Graph Coloring

Authors:
Massimiliano Caramia;Paolo Dell'Olmo
Affiliations:
-;-
Venue:
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Year:
1999

Citing 10
Cited 0

A generalized implicit enumeration algorithm for graph coloring

Communications of the ACM - Lecture notes in computer science Vol. 174
An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems

IEEE Transactions on Computers
Using tabu search techniques for graph coloring

Computing
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
On the hardness of approximating minimization problems

Journal of the ACM (JACM)
The Complexity of Near-Optimal Graph Coloring

Journal of the ACM (JACM)
New methods to color the vertices of a graph

Communications of the ACM
Scheduling in Computer and Manufacturing Systems

Scheduling in Computer and Manufacturing Systems
Meta-Heuristics: Theory and Applications

Meta-Heuristics: Theory and Applications
Graph Coloring with Adaptive Evolutionary Algorithms

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

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.