A visual demo of the color refinement algorithm.
- Use it online
The color refinement algorithm is a heuristic method to detect whether two graphs are isomorphic (see, e.g., [GKMS17+]). It is also known as the 1-dimensional Weisfeiler-Leman algorithm.
[GKMS17+] Martin Grohe, Kristian Kersting, Martin Mladenov, and Pascal Schweitzer. Color Refinement and its Applications. In An Introduction to Lifted Probabilistic Inference. Cambridge University Press. To appear. (preprint url)