Weisfeiler Leman graph isomorphism test
id:
weisfeiler-leman-graph-isomorphism-test-173-15293721
title:
Weisfeiler Leman graph isomorphism test
text:
In graph theory, the Weisfeiler Leman graph isomorphism test is a heuristic test for the existence of an isomorphism between two graphs G and H. It is a generalization of the color refinement algorithm and has been first described by Weisfeiler and Leman in 1968. The original formulation is based on graph canonization, a normal form for graphs, while there is also a combinatorial interpretation in the spirit of color refinement and a connection to logic. There are several versions of the test re
brand slug:
wiki
category slug:
encyclopedia
description:
Heuristic test for graph isomorphism
original url:
https://en.wikipedia.org/wiki/Weisfeiler_Leman_graph_isomorphism_test
date created:
2023-10-28T20:14:56Z
date modified:
2024-09-02T11:24:30Z
main entity:
{"identifier":"Q113844288","url":"https://www.wikidata.org/entity/Q113844288"}
image:
fields total:
13
integrity:
15