Epcot: An efficient procedure for colori
✍
N. Dubois; D. de Werra
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 707 KB
We present an exact procedure for coloring the nodes of s graph with as few colors as possible. The problem o~ deciding whether an arbitrary graph can be colored with k colars is NP-complete. The procedure is based ms an implicit enumm'&tion technique. At some stsgrs of the algorithm heuristic metho