Access Restriction

Author Jackowski, Boguslaw ♦ Kubale, Marek
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
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.
Description Affiliation: Technical Univ. of Gdan´sk, Gdan´sk, Poland (Kubale, Marek) || Polish Academy of Sciences, Gdan´sk, Poland (Jackowski, Boguslaw)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 28
Issue Number 4
Page Count 7
Starting Page 412
Ending Page 418

Open content in new tab

   Open content in new tab
Source: ACM Digital Library