An exact graph coloring algorithm using color exchange (Q1374088)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An exact graph coloring algorithm using color exchange |
scientific article; zbMATH DE number 1092969
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact graph coloring algorithm using color exchange |
scientific article; zbMATH DE number 1092969 |
Statements
An exact graph coloring algorithm using color exchange (English)
0 references
2 December 1997
0 references
The authors apply a method based on a theorem of Berge and give an algorithm for coloring the vertices of a graph. The original Berge algorithm, a modified version of it, and a simple branch-and-bound backtracking algorithm are executed on PC AT 486 computer to produce an exact coloring function. The authors' implementation has the merit that it does not require a large amount of memory.
0 references
chromatic number
0 references
coloring
0 references
algorithm
0 references
0.8029844164848328
0 references
0.7899483442306519
0 references
