GENERALIZED IMPLICIT ENUMERATION ALGORITHM FOR GRAPH COLORING.

Abstract

A generalized algorithm for graph coloring by implicit enumeration is formulated. A number of backtracking sequential methods are discussed in terms of the generalized algorithm. Some are revealed to be partially correct and inexact. A few corrections to the invalid algorithms, which cause these algorithms to guarantee optimal solutions, are proposed. Finally, ome computational results and remarks on the practical relevance of improved implicit enumeration algorithms are given.