Recognition: unknown
The k-Dimensional Weisfeiler-Leman Algorithm
classification
💻 cs.CC
cs.DSmath.LO
keywords
algorithmdimensionalweisfeiler-lemananalysisdetailsfixedimmerman-landernote
read the original abstract
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(n^{k+1}\log n)$, where $k$ is fixed (not varying with $n$).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.