The Weisfeiler-Lehman Method and Graph Isomorphism Testing

Details The Weisfeiler-Lehman Method and Graph Isomorphism Testing The Weisfeiler-Lehman Method and Graph Isomorphism Testing

2011-01-27

arxiv.org/abs/1101.5211v1

Mathematics

Combinatorics

Scientific paper

Properties of the `$k$-equivalent' graph families constructed in Cai, F\"{u}rer and Immerman, and Evdokimov and Ponomarenko are analysed relative the the recursive $k$-dim WL method. An extension to the recursive $k$-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.

Affiliated with

Also associated with

No associations

Rating

The Weisfeiler-Lehman Method and Graph Isomorphism Testing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Weisfeiler-Lehman Method and Graph Isomorphism Testing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Weisfeiler-Lehman Method and Graph Isomorphism Testing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-544428