mlsanityData to 14 Oct 2026

The k-Dimensional Weisfeiler-Leman Algorithm

arXiv 1907.09582 ↗First posted 22 Jul 2019cs.CC cs.DS math.LOcited by 2

Not on the map. Why?

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).

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

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 0; 2025: 1.

2 papers.

  1. 2025Bridging Theory and Practice in Link Representation with Graph Neural Networkscited by 4
  2. 2023Local Fragments, Global Gains: Subgraph Counting using Graph Neural Networkscited by 0