The Weisfeiler-Lehman Method and Graph Isomorphism Testing
Authors
B. L. Douglas
Abstract
Properties of the `-equivalent' graph families constructed in Cai, Fü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.
