1 paper
Yasutaka Uchida, Kaito Yajima, Kazuya Haraguchi
The vertex coloring problem is a well-known NP-hard problem and has many applications in operations research and in scheduling. A conventional approach to the problem solves the k-…