graph coloring

(redirected from Graph coloring problem)

graph coloring

References in periodicals archive ?
This also provides a rigorous evidence for the usefulness of the message passing paradigm for the graph coloring problem.
In the graph coloring problem we are given a graph G = (V,E) and are asked to produce a proper k-coloring f with a minimal possible k.
MCCORMICK, Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem, Math.
MORE, Estimation of sparse Jacobian matrices and graph coloring problems, SIAM J.
Xie [2] formulate the exam timetabling problem as a graph coloring problem.