The priority-based coloring approach to register allocation
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Complexity of Near-Optimal Graph Coloring
Journal of the ACM (JACM)
An Evolutionary Annealing Approach to Graph Coloring
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
A survey of local search methods for graph coloring
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
A graph coloring heuristic using partial solutions and a reactive tabu scheme
Computers and Operations Research
An adaptive memory algorithm for the k-coloring problem
Discrete Applied Mathematics
A Metaheuristic Approach for the Vertex Coloring Problem
INFORMS Journal on Computing
Computers and Operations Research
Safe lower bounds for graph coloring
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Graph coloring with a distributed hybrid quantum annealing algorithm
KES-AMSTA'11 Proceedings of the 5th KES international conference on Agent and multi-agent systems: technologies and applications
Improving the extraction and expansion method for large graph coloring
Discrete Applied Mathematics
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
Hi-index | 0.00 |
Quantum annealing extends simulated annealing by introducing artificial quantum fluctuations. The path-integral Monte Carlo version chosen is population-based and designed to be implemented on a classical computer. Its first application to the graph coloring problem is presented in this paper. It is shown by experiments that quantum annealing can outperform classical thermal simulated annealing for this particular problem. Moreover, quantum annealing proved competitive when compared with the best algorithms on most of the difficult instances from the DIMACS benchmarks. The quantum annealing algorithm has even found that the well-known benchmark graph dsjc1000.9 has a chromatic number of at most 222. This is an improvement on its best upper-bound from a large body of literature.