2026-07-22T13:49:42Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:11863 2024-03-06T10:48:52Z ddc:004 open_access

Weisfeiler and Leman’s Unlikely Journey from Graph Isomorphism to Neural Networks (Invited Talk) Grohe, Martin Weisfeiler adn Leman algorithm Graph isomorphism Neural network logic algebra linear and semi-definite programming The Weisfeiler-Leman algorithm is a well-known combinatorial graph isomorphism test going back to work of Weisfeiler and Leman in the late 1960s. The algorithm has a surprising number of seemingly unrelated characterisations in terms of logic, algebra, linear and semi-definite programming, and graph homomorphisms. Due to its simplicity and efficiency, it is an important subroutine of all modern graph isomorphism tools. In recent years, further applications in linear optimisation, probabilistic inference, and machine learning have surfaced. In the first part of my talk, I will give an introduction to the Weisfeiler-Leman algorithm and its various characterisations. In the second part I will speak about its applications, in particular about recent work relating the algorithm to graph neural networks. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Martin Grohe 2020 Is Part Of LIPIcs, Volume 154, 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2020.2 urn:nbn:de:0030-drops-118634 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.2 eng https://creativecommons.org/licenses/by/3.0/legalcode