graph coloring

(redirected from Coloring problem)

graph coloring

References in periodicals archive ?
A graph coloring problem starts with a graph - a visual representation of a set of objects connected in some way.
The ant colony algorithm, which is a bionic algorithm, is applied herein to the study of the three regular graph coloring problem, in order to gain a more reasonable solution to the problems of coloring and number labeling.
We show that if [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] is a family of graphs such that list coloring problem is NP-complete for that family.
The search for an ideal blockmodel can usually be formulated as a graph coloring problem.
Theorem 11 The EQUITABLE COLORING problem can be solved in time [absolute value of V] [absolute value of E]r x [2.
We represent this channel assignment problem as an edge coloring problem of graph theory.
Folding and coloring problem in mathematics and physics, Bulletin of the American Mathematics Society, 37 (2000), 251-307
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.
MCCORMICK, Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem, Math.
Xie [2] formulate the exam timetabling problem as a graph coloring problem.
The cyclic coloring problem and estimation of spare hessian matrices.
Motwani and Naor [1993] have shown that the approximate graph coloring problem is closely related to the problem of finding a CUT COVER of the edges of a graph.