Author:
Grelier Cyril,Goudet Olivier,Hao Jin-Kao
Publisher
Springer International Publishing
Reference24 articles.
1. Brélaz, D.: New methods to color the vertices of a graph. Commun. ACM 22(4), 251–256 (1979)
2. Browne, C.B., et al.: A survey of monte Carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1–43 (2012)
3. Cazenave, T., Negrevergne, B., Sikora, F.: Monte Carlo graph coloring. In: Monte Carlo Search 2020, IJCAI Workshop (2020)
4. Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems are. In: Proceedings of the 12th International Joint Conference on Artificial Intelligence - Volume 1. IJCAI 1991, pp. 331–337. Morgan Kaufmann Publishers Inc. (1991)
5. Cornaz, D., Furini, F., Malaguti, E.: Solving vertex coloring problems as maximum weight stable set problems. Discrete Appl. Math. 217, 151–162 (2017). https://doi.org/10.1016/j.dam.2016.09.018
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献