ConceptAI & ML
Weisfeiler-Leman algorithm
An algorithm that takes two graphs and iteratively colors nodes based on neighborhood structures to decide if the graphs are isomorphic.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Graph isomorphism1Graph theory1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.