Weisfeiler–Leman algorithm (Q113844288)
Jump to navigation
Jump to search
heuristic algorithm for testing whether two graphs are isomorphic
- Colour Refinement
- Color Refinement
- Weisfeiler Leman graph isomorphism test
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Weisfeiler–Leman algorithm |
heuristic algorithm for testing whether two graphs are isomorphic |
|
Statements
GNN representational limits.png
3,430 × 3,510; 502 KB
3,430 × 3,510; 502 KB
Two graphs which are not distinguished by the Colour Refinement algorithm. (British English)
0 references
1 reference