[88] C. Morris. The power of the Weisfeiler-Leman algorithm for machine learning with graphs. In International Joint Conference on Artificial Intelligence, pages 4543-4550, 2021. 3
[89] C. Morris, M. Ritzert, M. Fey, W. L. Hamilton, J. E. Lenssen, G. Rattan, and M. Grohe. Weisfeiler and leman go neural: Higher-order graph neural networks. In AAAI Conference on Artificial Intelligence, pages 4602-4609, 2019. 1, 3, 9, 20
[90] C. Morris, N. M. Kriege, F. Bause, K. Kersting, P. Mutzel, and M. Neumann. TUDataset: A collection of benchmark datasets for learning with graphs. CoRR, 2020. 9, 43
[91] C. Morris, G. Rattan, and P. Mutzel. Weisfeiler and Leman go sparse: Towards higher-order graph embeddings. In Advances in Neural Information Processing Systems, 2020. 3, 20
[92] C. Morris, Y. L., H. Maron, B. Rieck, N. M. Krieger, M. Grohe, M. Fey, and K. Borgwardt. Weisfeiler and Leman go machine learning: The story so far. ArXiv preprint, 2021. 1, 18, 20
[93] C. Morris, G. Rattan, S. Kiefer, and S. Ravanbakhsh. SpeqNets: Sparsity-aware permutation-equivariant graph networks. In International Conference on Machine Learning, pages 16017-16042, 2022. 3, 20
[94] C. Morris, F. Geerts, J. Tönshoff, and M. Grohe. WL meet VC. ArXiv preprint, abs/2301.11039, 2023. 1
[95] H. Nguyen and T. Maehara. Graph homomorphism convolution. In International Conference on Machine Learning, pages 7306-7316, 2020. 20
[96] J. B. Orlin. Max flows in  $\mathrm{O}(\mathrm{nm})$  time, or better. In Symposium on Theory of Computing, pages 765-774, 2013. doi: 10.1145/2488608.2488705.26
[97] O. Pele and M. Werman. A Linear Time Histogram Metric for Improved SIFT Matching. In Computer Vision – ECCV 2008, pages 495–508, 2008. ISBN 978-3-540-88690-7. 2, 26
[98] O. Pele and M. Werman. Fast and robust Earth Mover's Distances. In IEEE International Conference on Computer Vision, pages 460-467, Sept. 2009. 26, 30
[99] Y. V. Prokhorov. Convergence of Random Processes and Limit Theorems in Probability Theory. Theory of Probability & Its Applications, 1956. 2, 6, 7, 23
[100] O. Puny, D. Lim, B. T. Kiani, H. Maron, and Y. Lipman. Equivariant polynomials for graph neural networks. ArXiv preprint, abs/2302.11556, 2023. 20
[101] P. Reiser, M. Neubert, A. Eberhard, L. Torresi, C. Zhou, C. Shao, H. Metni, C. van Hoesel, H. Schopmans, T. Sommer, et al. Graph neural networks for materials science and chemistry. Communications Materials, 3(1):93, 2022. 1
[102] E. Rosenbluth, J. Tönshoff, and M. Grohe. Some might say all you need is sum. ArXiv preprint, abs/2302.11603, 2023. 20
[103] L. Ruiz, L. F. O. Chamon, and A. Ribeiro. Graphon signal processing. IEEE Transactions on Signal Processing, 69:4961-4976, 2021. 4
[104] R. Sato, M. Yamada, and H. Kashima. Random features strengthen graph neural networks. In SIAM International Conference on Data Mining, pages 333–341, 2021. 20
[105] F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini. The graph neural network model. IEEE Transactions on Neural Networks, 20(1):61-80, 2009. 2, 18
[106] G. Schay. Nearest Random Variables with Given Distributions. The Annals of Probability, 2(1): 163-166, 1974. 24, 28, 29
[107] M. Simonovsky and N. Komodakis. Dynamic edge-conditioned filters in convolutional neural networks on graphs. In IEEE Conference on Computer Vision and Pattern Recognition, pages 29-38, 2017. 1
[108] A. Sperduti and A. Starita. Supervised neural networks for the classification of structures. IEEE Transactions on Neural Networks, 8(3):714-35, 1997. 2
[109] G. Tinhofer. Graph isomorphism and theorems of Birkhoff type. Computing, 36(4):285-300, Dec. 1986. 18
[110] G. Tinhofer. A note on compact graphs. Discrete Applied Mathematics, 30(2):253-264, Feb. 1991. 18