Isomorphism of Coloured Graphs with Slowly Increasing Multiplicity of Jordan Blocks

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

How Powerful are Graph Neural Networks? (2018, methodology): “…we characterize the representational capacity of GNNs via a slightly weaker criterion: the Weisfeiler-Lehman (WL) graph isomorphism test that is known to work well in general, with some few exceptions, in particular, regular graphs (Cai et al., 1992; Douglas, 2011; Evdokimov & Ponomarenko, 1999).”