The Weisfeiler-Lehman Isomorphism Test
Resource history | v1 (current) | created by janarez
Details
The Weisfeiler-Lehman Isomorphism Test
see v1 | created by janarez | Add resource "The Weisfeiler-Lehman Isomorphism Test"
- Title
- The Weisfeiler-Lehman Isomorphism Test
- Type
- BlogPost
- Created
- no value
- Description
- 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.
- Link
- https://davidbieber.com/post/2019-05-10-weisfeiler-lehman-isomorphism-test/
- Identifier
- no value
authors
This resource has no history of related authors.
topics
(detached) Graph convolutional networks (GCN)
resources
This resource has no history of related resources.