The problem of how to fill in those colors, however, proved to be a different beast. Vizing came up with his own coloring algorithm, but it was slow. He started by looking at the time it would take to ...

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.

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 ...