Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm (Q5874317)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7650928
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm |
scientific article; zbMATH DE number 7650928 |
Statements
7 February 2023
0 references
graph isomorphism
0 references
Weisfeiler-Leman algorithm
0 references
Cai-Fürer-Immerman graphs
0 references
coherent configurations
0 references
Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm (English)
0 references
0 references
0.8721218
0 references
0.8721218
0 references
0 references
0.84610784
0 references
0 references
0.8425525
0 references
0.8415133
0 references
0.8415133
0 references
0 references
