Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm (Q5874317): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| label / en | label / en | ||
Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.4230/LIPIcs.STACS.2020.43 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3013311535 / rank | |||
Normal rank | |||
| Property / title | |||
Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm (English) | |||
| Property / title: Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm (English) / rank | |||
Normal rank | |||
Latest revision as of 11:05, 30 July 2024
scientific article; zbMATH DE number 7650928
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
