Brelaz's modification of Brown's exact coloring algorithm contains two errors as demonstrated in two examples. A correct version of the algorithm and a proof of the exactness are given. Finally, Brown's look-ahead rule is built into this algorithm.
A correction to Brelaz’s modification of Brown’s coloring algorithm
The Latest from CACM
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get InvolvedCommunications of the ACM (CACM) is now a fully Open Access publication.
By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.
Learn More
Join the Discussion (0)
Become a Member or Sign In to Post a Comment