Graph Coloring: The process of assigning colours to vertices or edges of a graph so that adjacent elements have distinct colours, commonly used in scheduling and resource allocation problems.

Simulated annealing is a randomized technique proposed by S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi for improving local optimization algorithms. Here we report on experiments at adapting simulated ...

Graph coloring has been employed since the 1980s to efficiently compute sparse Jacobian and Hessian matrices using either finite differences or automatic differentiation. Several coloring problems ...