Cosine: A new graph coloring algorithm

Authors:
A. Hertz
Affiliations:
Ecole Polytechnique Fédérale de Lausanne, Switzerland
Venue:
Operations Research Letters
Year:
1991

Citing 5
Cited 1

Using tabu search techniques for graph coloring

Computing
A fast algorithm for coloring Meyniel graphs

Journal of Combinatorial Theory Series B
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
New methods to color the vertices of a graph

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

An empirical evaluation of Gravitational Swarm Intelligence for graph coloring algorithm

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cosine is a graph coloring algorithm which has been especially designed for producing optimal colorings in a large class of perfect graphs. This algorithm is used as a heuristic method for getting an upper bound on the chromatic number of general graphs; this estimation is then considered as an initial step of a more sophisticated coloring procedure based on tabu search techniques. Cosine is compared with other methods having similar complexity and we show that Cosine realizes a good compromise between computational time and performance level.