An exponential lower bound for individualization-refinement algorithms for graph isomorphism (Q5230284)
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 7096991
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exponential lower bound for individualization-refinement algorithms for graph isomorphism |
scientific article; zbMATH DE number 7096991 |
Statements
An exponential lower bound for individualization-refinement algorithms for graph isomorphism (English)
0 references
22 August 2019
0 references
canonization
0 references
graph isomorphism
0 references
individualization-refinement
0 references
lower bounds
0 references
0.7568636536598206
0 references
0.739825963973999
0 references
0.7385852932929993
0 references
0.7347220182418823
0 references
