graph coloring

(redirected from Coloring problem)
Also found in: Wikipedia.

graph coloring

References in periodicals archive ?
They demonstrated the procedure for a mathematical coloring problem, which involves ensuring that no two points in certain networks of connected points have the same color.
Xie [2] formulate the exam timetabling problem as a graph coloring problem.
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.
7] --, Estimation of sparse Hessian matrices and graph coloring problems, Math.
While boosting the colorant level until color consistency is achieved is one to way fix a coloring problem, there is no precise way to determine how much extra colorant is really needed to make the difference.
As such, it is essential to understand the process of coloring at the machine, typical coloring problems and their solutions, and the impact of coloring on the bottom line.
Assuming the colorant ratio is correct, and there is no problem with the quality of the colorant itself, most coloring problems at the machine have to do with the quality and accuracy of the feeding equipment.
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.
Folding and coloring problem in mathematics and physics, Bulletin of the American Mathematics Society, 37 (2000), 251-307
Among them are the evolution of the basic theory of arrangements of surfaces, incidences and their relatives from Szemeredi and Trotter to cutting lenses, repeated patterns and pattern recognition, and geometric coloring problems.