Jump to content

Weisfeiler Leman graph isomorphism test

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Citation bot (talk | contribs) at 20:58, 28 October 2023 (Alter: title, doi. Add: s2cid, isbn, arxiv, pages, chapter, authors 1-1. Removed proxy/dead URL that duplicated identifier. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Jengod | #UCB_webform). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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]

References

  1. ^ 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
Retrieved from "https://en.wikipedia.org/w/index.php?title=Weisfeiler_Leman_graph_isomorphism_test&oldid=1182360589"