The Weisfeiler-Lehman Method and Graph Isomorphism Testing
From MaRDI portal
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.
This page was built for publication: The Weisfeiler-Lehman Method and Graph Isomorphism Testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6223188)
