The $k$-Dimensional Weisfeiler-Leman Algorithm
Computational Complexity
2019-07-24 v1 Data Structures and Algorithms
Logic
Abstract
In this note, we provide details of the -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 , where is fixed (not varying with ).
Keywords
Cite
@article{arxiv.1907.09582,
title = {The $k$-Dimensional Weisfeiler-Leman Algorithm},
author = {Neil Immerman and Rik Sengupta},
journal= {arXiv preprint arXiv:1907.09582},
year = {2019}
}
Comments
7 pages