HyColor: An Efficient Heuristic Algorithm for Graph Coloring

TL;DR

HyColor is a new hybrid heuristic algorithm that efficiently solves large-scale sparse and small dense graph coloring problems, outperforming existing methods in solution quality and speed.

Contribution

The paper introduces HyColor, a novel hybrid heuristic algorithm that effectively handles large sparse and small dense graphs for the graph coloring problem.

Findings

HyColor outperforms three state-of-the-art algorithms on 209 benchmark instances.

Achieved best solutions in over 93% of instances, with 34 significantly better.

Successfully determined the chromatic number and optimal coloring in 128 cases.

Abstract

The graph coloring problem (GCP) is a classic combinatorial optimization problem that aims to find the minimum number of colors assigned to vertices of a graph such that no two adjacent vertices receive the same color. GCP has been extensively studied by researchers from various fields, including mathematics, computer science, and biological science. Due to the NP-hard nature, many heuristic algorithms have been proposed to solve GCP. However, existing GCP algorithms focus on either small hard graphs or large-scale sparse graphs (with up to 10^7 vertices). This paper presents an efficient hybrid heuristic algorithm for GCP, named HyColor, which excels in handling large-scale sparse graphs while achieving impressive results on small dense graphs. The efficiency of HyColor comes from the following three aspects: a local decision strategy to improve the lower bound on the chromatic number; a graph-reduction strategy to reduce the working graph; and a k-core and mixed degree-based greedy heuristic for efficiently coloring graphs. HyColor is evaluated against three state-of-the-art GCP algorithms across four benchmarks, comprising three large-scale sparse graph benchmarks and one small dense graph benchmark, totaling 209 instances. The results demonstrate that HyColor consistently outperforms existing heuristic algorithms in both solution accuracy and computational efficiency for the majority of instances. Notably, HyColor achieved the best solutions in 194 instances (over 93%), with 34 of these solutions significantly surpassing those of other algorithms. Furthermore, HyColor successfully determined the chromatic number and achieved optimal coloring in 128 instances.