On the Hardness of Graph Isomorphism (Q4651507)
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 2135808
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Hardness of Graph Isomorphism |
scientific article; zbMATH DE number 2135808 |
Statements
On the Hardness of Graph Isomorphism (English)
0 references
21 February 2005
0 references
graph isomorphism
0 references
complexity
0 references
reducibility
0 references
0.8434544205665588
0 references
0.8390470147132874
0 references
0.8342875242233276
0 references
0.8258089423179626
0 references
