Simulated Annealing Algorithm for Graph Coloring
Artificial Intelligence
2017-12-05 v1
Abstract
The goal of this Random Walks project is to code and experiment the Markov Chain Monte Carlo (MCMC) method for the problem of graph coloring. In this report, we present the plots of cost function by varying the parameters like (Number of colors that can be used in coloring) and (Average node degree). The results are obtained by using simulated annealing scheme, where the temperature (inverse of ) parameter in the MCMC is lowered progressively.
Keywords
Cite
@article{arxiv.1712.00709,
title = {Simulated Annealing Algorithm for Graph Coloring},
author = {Alper Kose and Berke Aral Sonmez and Metin Balaban},
journal= {arXiv preprint arXiv:1712.00709},
year = {2017}
}