1 code implementation • 24 Apr 2023 • Cyril Grelier, Olivier Goudet, Jin-Kao Hao
This work investigates the Monte Carlo Tree Search (MCTS) method combined with dedicated heuristics for solving the Weighted Vertex Coloring Problem.
1 code implementation • 3 Feb 2022 • Cyril Grelier, Olivier Goudet, Jin-Kao Hao
This work presents the first study of using the popular Monte Carlo Tree Search (MCTS) method combined with dedicated heuristics for solving the Weighted Vertex Coloring Problem.
no code implementations • 13 Sep 2021 • Olivier Goudet, Cyril Grelier, Jin-Kao Hao
Given an undirected graph $G=(V, E)$ with a set of vertices $V$ and a set of edges $E$, a graph coloring problem involves finding a partition of the vertices into different independent sets.