Jump to content

Talk:Weisfeiler Leman graph isomorphism test

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Christian75 (talk | contribs) at 14:36, 20 January 2025 (Assessment (Low): +banner shell (C), +Computer science (Rater)). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Mislabeled?

[edit]

I'm just trying to understand this algorithm so please excuse me if I'm mistaken but I think the labeling in this image is wrong for node A on the right after the second step (i.e. 3rd row). A was partitioned into partition 1, and its neighbours are in partition 1 and 2 each, so shouldn't it be labeled 1_1_2 on the next step?

/media/wikipedia/commons/9/92/WLGraph01.svg Fangs124 (talk) 10:17, 10 December 2023 (UTC)[reply]

In order to see color-refinement in action, please check out https://holgerdell.github.io/color-refinement/. And you are correct, A should be labeled 1_1_2. I don't believe the examples are overly helpful, so I am considering to remove them. Martinalex000 (talk) 15:30, 29 May 2024 (UTC)[reply]