{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T10:17:03Z","timestamp":1781259423906,"version":"3.54.1"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2020,11,16]],"date-time":"2020-11-16T00:00:00Z","timestamp":1605484800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM SIGLOG News"],"published-print":{"date-parts":[[2020,11,16]]},"abstract":"<jats:p>More than half a century after its first formulation, the Weisfeiler-Leman (WL) algorithm is still an important combinatorial technique whenever graphs or other relational structures are to be classified. However, despite its simple algebraic description and its variety of applications, we still lack a precise understanding of the expressive power of the algorithm.<\/jats:p>\n          <jats:p>This column introduces the reader to the basic concepts of the WL algorithm and discusses its dimension as a parameter to capture the structural complexity of an input graph. Specifically, I present a survey of work regarding the WL dimension conducted with my co-authors. First, I outline the proof that the 3-dimensional WL algorithm (3-WL) is able to identify every planar graph. The proof version presented here relies on strong insights about the ability of 2-WL to decompose graphs. Afterwards, I highlight the most important ingredients of the generalisation of our bound to graphs that are parameterised by their Euler genus.<\/jats:p>\n          <jats:p>Further details as well as a study of other aspects of the WL algorithm can be found in my dissertation [Kiefer 2020].<\/jats:p>","DOI":"10.1145\/3436980.3436982","type":"journal-article","created":{"date-parts":[[2020,11,25]],"date-time":"2020-11-25T02:30:49Z","timestamp":1606271449000},"page":"5-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["The Weisfeiler-Leman algorithm"],"prefix":"10.1145","volume":"7","author":[{"given":"Sandra","family":"Kiefer","sequence":"first","affiliation":[{"name":"RWTH Aachen University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,11,16]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190050305"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-016-0147-6"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/120867834"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897542"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/0209047"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01305232"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(82)90016-0"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.37236\/1509"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.STACS.2020.43"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/646254.684263"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.23638\/LMCS-15(1:4)2019"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/788020.788896"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335313"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2371656.2371662"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1017\/9781139028868"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2019.117"},{"key":"e_1_2_1_17_1","volume-title":"A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus. Computing Research Repository","author":"Grohe Martin","year":"2019"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1017\/jsl.2015.28"},{"key":"e_1_2_1_19_1","volume-title":"Deep Weisfeiler Leman. Computing Research Repository","author":"Grohe Martin","year":"2020"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0070"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4478-3_5"},{"key":"e_1_2_1_23_1","volume-title":"47th International Colloquium on Automata, Languages, and Programming (ICALP 2020) (Leibniz International Proceedings in Informatics (LIPIcs)), Artur Czumaj, Anuj Dawar, and Emanuela Merelli (Eds.)","volume":"168","author":"Kiefer Sandra","year":"2020"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.MFCS.2019.45"},{"key":"e_1_2_1_25_1","volume-title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs. Computing Research Repository","author":"Kiefer Sandra","year":"2019"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3333003"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2933595"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48057-1_25"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1201\/b15385"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.69"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.4064\/fm-15-1-271-283"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2019.8785694"},{"key":"e_1_2_1_33_1","volume-title":"Practical Graph Isomorphism. Congressus Numerantium 30","author":"McKay Brendan D.","year":"1981"},{"key":"e_1_2_1_34_1","volume-title":"Graphs on Surfaces","author":"Mohar Bojan"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1021\/c160017a018"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014602"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216062"},{"key":"e_1_2_1_38_1","volume-title":"Defining PTIME Problems on Planar Graphs with Few Variables. Master's thesis","author":"Redies Joachim"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(90)90063-6"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-13.1.743"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01594196"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.2307\/2371086"}],"container-title":["ACM SIGLOG News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3436980.3436982","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3436980.3436982","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:20Z","timestamp":1750197740000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3436980.3436982"}},"subtitle":["an exploration of its power"],"short-title":[],"issued":{"date-parts":[[2020,11,16]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,11,16]]}},"alternative-id":["10.1145\/3436980.3436982"],"URL":"https:\/\/doi.org\/10.1145\/3436980.3436982","relation":{},"ISSN":["2372-3491"],"issn-type":[{"value":"2372-3491","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,16]]},"assertion":[{"value":"2020-11-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}