1 paper
Jiaxin Hou, Yong Sheng Soh, Antonios Varvitsiotis
The problems of computing graph colorings and clique covers are central challenges in combinatorial optimization. Both of these are known to be NP-hard, and thus computationally in…