264 citations · 1.3k across the 57 of their papers we have counts for
1 paper · 1 filter
Wei Li, Ruxuan Li, Yuzhe Ma +3
Graph coloring, a classical and critical NP-hard problem, is the problem of assigning connected nodes as different colors as possible. However, we observe that state-of-the-art GNN…