The k-Dimensional Weisfeiler-Leman Algorithm.
2019
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$).
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
4
References
2
Citations
NaN
KQI