Tight lower and upper bounds for the complexity of canonical colour refinement (Q2398207)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight lower and upper bounds for the complexity of canonical colour refinement |
scientific article |
Statements
Tight lower and upper bounds for the complexity of canonical colour refinement (English)
0 references
15 August 2017
0 references
graph isomorphism
0 references
colour refinement
0 references
partition refinement
0 references
canonical labelling
0 references
