Skip to content
A visual demo of the color refinement algorithm
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
.eslintrc.json
.gitignore
LICENSE
README.md
cr.js
index.html
normalize.css
package.json
screenshot.png
style.css

README.md

Color Refinement

A visual demo of the color refinement algorithm.

  • Use it online
  • For offline use, clone this repository and download the D3 JavaScript library: d3.v5.min.js

Screenshot

screenshot

Description

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.

Built with

References

[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)

You can’t perform that action at this time.
You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session.