Efficient Coloring of a Large Spectrum of Graphs

We have developed a new algorithm and software for graph coloring by systematically combining several algorithm and software development ideas that had crucial impact on the algorithm's performance. The algorithm explores the divideand-conquer paradigm, global search for constrained independent sets using a computationally inexpensive objective function, assignment of most-constrained vertices to leastconstraining colors, reuse and locality exploration of intermediate solutions, search time management, post-processing lottery-scheduling iterative improvement, and statistical parameter determination and validation. The algorithm was tested on a set of real-life examples. We found that hard-tocolor real-life examples are common especially in domains where problem modeling results in denser graphs. Systematic experimentations demonstrated that for numerous instances the algorithm outperformed all other implementations reported in literature in solution quality and run-time.

• Type: Conference
• Year: 1998
• Where: DAC
• Authors: Darko Kirovski, Miodrag Potkonjak
• Keywords: DAC 1998, Design Automation, Hard-tocolor Real-life Examples, Real-life Examples, Statistical Parameter Determination