# The k-Dimensional Weisfeiler-Leman Algorithm

arXiv: https://arxiv.org/abs/1907.09582 · HTML: https://mlsanity.com/paper/1907.09582/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 22 Jul 2019.

## Built on by (most cited first, 2 of 2)

- [Bridging Theory and Practice in Link Representation with Graph Neural Networks](https://mlsanity.com/paper/2506.24018/) (2025)
- [Local Fragments, Global Gains: Subgraph Counting using Graph Neural Networks](https://mlsanity.com/paper/2305.19659/) (2023)

## Abstract (arXiv)

In this note, we provide details of the k-dimensional Weisfeiler-Leman Algorithm and its analysis from Immerman-Lander (1990). In particular, we present an optimized version of the algorithm that runs in time O(nk+1log n), where k is fixed (not varying with n).