The Weisfeiler-Lehman Isomorphism Test

Resource | v1 | created by janarez |
Type Blog post
Created unavailable
Identifier unavailable


Two graphs are considered isomorphic if there is a mapping between the nodes of the graphs that preserves node adjacencies. Here is the algorithm for the Weisfeiler-Lehman Isomorphism Test. It produces for each graph a canonical form. If the canonical forms of two graphs are not equivalent, then the graphs are definitively not isomorphic. However, it is possible for two non-isomorphic graphs to share a canonical form, so this test alone cannot provide conclusive evidence that two graphs are isomorphic.


about Graph isomorphism problem

The graph isomorphism problem is the computational problem of determining whether two finite graphs a...

Edit details Edit relations Attach new author Attach new topic Attach new resource
7.0 /10
useless alright awesome
from 1 review
Write comment Rate resource Tip: Rating is anonymous unless you also write a comment.
Resource level 2.0 /10
beginner intermediate advanced
Resource clarity 9.0 /10
hardly clear sometimes unclear perfectly clear
Reviewer's background 3.0 /10
none basics intermediate advanced expert
Comments 0
Currently, there aren't any comments.