Rethinking Graph Neural Networks for the Graph Coloring Problem

no code implementations • 15 Aug 2022 • Wei Li, Ruxuan Li, Yuzhe ma, Siu On Chan, David Pan, Bei Yu

Graph coloring, a classical and critical NP-hard problem, is the problem of assigning connected nodes as different colors as possible.

Rethinking Graph Neural Networks for Graph Coloring

no code implementations • 1 Jan 2021 • Wei Li, Ruxuan Li, Yuzhe ma, Siu On Chan, Bei Yu

To characterize the power of GNNs for the graph coloring problem, we first formalize the discrimination power of GNNs as the capability to assign nodes different colors.