The Weisfeiler-Lehman Method and Graph Isomorphism Testing
Combinatorics
2011-01-28 v1
Abstract
Properties of the `-equivalent' graph families constructed in Cai, F\"{u}rer and Immerman, and Evdokimov and Ponomarenko are analysed relative the the recursive -dim WL method. An extension to the recursive -dim WL method is presented that is shown to efficiently characterise all such types of `counterexample' graphs, under certain assumptions. These assumptions are shown to hold in all known cases.
Cite
@article{arxiv.1101.5211,
title = {The Weisfeiler-Lehman Method and Graph Isomorphism Testing},
author = {B. L. Douglas},
journal= {arXiv preprint arXiv:1101.5211},
year = {2011}
}