The power of the Weisfeiler-Leman algorithm to decompose graphs (Q5028356)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The power of the Weisfeiler-Leman algorithm to decompose graphs |
scientific article; zbMATH DE number 7471549
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The power of the Weisfeiler-Leman algorithm to decompose graphs |
scientific article; zbMATH DE number 7471549 |
Statements
The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs (English)
0 references
9 February 2022
0 references
Weisfeiler-Leman algorithm
0 references
graph isomorphism
0 references
graph decomposition
0 references
dynamic programming
0 references
time complexity
0 references
0.8110793232917786
0 references
0.8042521476745605
0 references
0.7999107837677002
0 references
0.789717435836792
0 references
0.7853147983551025
0 references
