NeurIPS 2019
Sun Dec 8th through Sat the 14th, 2019 at Vancouver Convention Center
Paper ID: 1275 Provably Powerful Graph Networks

Similar to the k-WL graph kernel approach, the authors present $k$-order graph neural networks. The prove connections to the WL algorithm and also show empirical evidence. Overall, the reviews as well as the discussion clearly show that the connection established and the results, both on theory as well as in praxis are interesting and should be published.