A Range-Compaction Heuristic for Graph Coloring

Abstract

This paper presents a novel heuristic for graph coloring that works on a range of colors and iteratively tries to make this range more compact. This range-compaction heuristic also has a \pressure" component and an annealing schedule for it. The value of this component is empirically quanti ed. This algorithm is evaluated on a wide range of DIMACS benchmark… (More)
DOI: 10.1023/B:HEUR.0000012448.70007.32

7 Figures and Tables

Topics

  • Presentations referencing similar topics