Direct product primality testing of graphs is GI-hard (Q1998840)
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 7318688
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Direct product primality testing of graphs is GI-hard |
scientific article; zbMATH DE number 7318688 |
Statements
Direct product primality testing of graphs is GI-hard (English)
0 references
9 March 2021
0 references
Kronecker product
0 references
graph factorization
0 references
graph isomorphism
0 references
GI-complexity
0 references
0.7834974527359009
0 references
0.777714729309082
0 references
0.7726212739944458
0 references
0.7710282802581787
0 references
0.7665818929672241
0 references
