ACM

Communications of the ACM

Home/Magazine Archive/April 1985 (Vol. 28, No. 4)/A generalized implicit enumeration algorithm for graph.../Abstract

A generalized implicit enumeration algorithm for graph coloring

By Marek Kubale, Boguslaw Jackowski
Communications of the ACM, April 1985, Vol. 28 No. 4, Pages 412-418
10.1145/3341.3350
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

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.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.