Year: 1985
Type: article
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, some computational results and remarks on the practical relevance of improved implicit enumeration algorithms are given.
Source: Communications of the ACM
DOI: 10.1145/3341.3350
Authors: Marek Kubale, Boguslaw Jackowski
Institutions: Gdańsk University of Technology, Polish Academy of Sciences
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W1982710805
