Thumbnail
Access Restriction
Subscribed

Author Peemöller, Jürgen
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Graph coloring ♦ Branch and bound ♦ Computed backtracking ♦ Exact method ♦ Look-ahead rule ♦ Chromatic number
Abstract 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.
Description Affiliation: Hochschule der Bundeswehr Hamburg, Hamburg, West Germany (Peemöller, Jürgen)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 26
Issue Number 8
Page Count 3
Starting Page 595
Ending Page 597


Open content in new tab

   Open content in new tab
Source: ACM Digital Library