This paper presents a heuristic graph coloring algorithm namedMIPS-CLR, a Minimal-state Processing Search algorithm for the graphCoLoRing problem. Given a graph G(V,E), the goal of this NP-completeproblem is to find a color Assignment to every vertex in V such thatany pair of adjacent Vertices must not receive the same color butalso the total num- Ber of colors should be minimized. The graphcoloring problem Has been widely studied due to its large number ofpractical ap- Plications in various fields.
展开▼
机译：该文提出了一种名为MIPS-CLR的启发式图着色算法，这是一种用于graphCoLoRing问题的最小状态处理搜索算法。给定一个图形 G（V，E），这个 NP 完备问题的目标是找到 V 中每个顶点的颜色分配，使得任何一对相邻的顶点都不能接收相同的颜色，并且颜色的总数量应该最小化。图形着色问题因其在各个领域的大量实际应用而得到广泛研究。
展开▼
