Weisfeiler Leman graph isomorphism test information
This article has an unclear citation style. The references used may be made clearer with a different or consistent style of citation and footnoting.(December 2023) (Learn how and when to remove this message)
This article may contain an excessive amount of intricate detail that may interest only a particular audience. Please help by spinning off or relocating any relevant information, and removing excessive detail that may be against Wikipedia's inclusion policy.(December 2023) (Learn how and when to remove this message)
Heuristic test for graph isomorphism
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.[1] It is based on a normal form for graphs first described in an article by Weisfeiler and Leman in 1968.[2] There are several versions of the test referred to in the literature by various names, which easily leads to confusion.
^Huang, Ningyuan; Villar, Soledad (2022), "A Short Tutorial on the Weisfeiler-Lehman Test and Its Variants", ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 8533–8537, arXiv:2201.07083, doi:10.1109/ICASSP39728.2021.9413523, ISBN 978-1-7281-7605-5, S2CID 235780517
^Weisfeiler, B. Yu.; Leman, A. A. (1968). "A Reduction of a Graph to a Canonical Form and an Algebra Arising during This Reduction" (PDF). Nauchno-Technicheskaya Informatsia. 2 (9): 12–16. Retrieved 2023-10-28.
and 7 Related for: Weisfeiler Leman graph isomorphism test information
At the same time, isomorphism for many special classes of graphs can be solved in polynomial time, and in practice graphisomorphism can often be solved...
Weisfeiler–Lemangraphisomorphismtest. In 2020, a universal approximation theorem result was established by Brüel-Gabrielsson, showing that graph representation...
version of the Weisfeiler-Leman algorithm, is a routine used for testing whether two graphs are isomorphic. The algorithm takes as an input a graph G {\displaystyle...
Global Information