The k-Dimensional Weisfeiler-Leman Algorithm

07/22/2019

∙

by   Neil Immerman, et al.

∙

0

∙

share

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+1log n), where k is fixed (not varying with n).