aureooms-contrib/color-refinement

A visual demo of the color refinement algorithm

Color Refinement

A visual demo of the color refinement algorithm.

• Use it online
• For offline use, you will need to download the external resources loaded at the top of index.html, and change the paths correspondingly.

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.

Development

Install the development tools:

yarn

Start an http server for local development:

yarn run http-server

Manually run the JavaScript linter standard:

yarn run standard

Manually run the CSS linter stylelint:

yarn run stylelint "**/*.css"

Both linters support --fix for automatic fixing.

Visual Studio Code provides the extensions chenxsan.vscode-standardjs and stylelint.vscode-stylelint for automatic linting.

Built with

• D3.js
• CSS grid
• normalize.css

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)