A Heuristic for Direct Product Graph Decomposition (Q6075715)
From MaRDI portal
!
WARNING
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 7740699
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Heuristic for Direct Product Graph Decomposition |
scientific article; zbMATH DE number 7740699 |
Statements
A Heuristic for Direct Product Graph Decomposition (English)
0 references
20 September 2023
0 references
directed, unweighted graphs
0 references
graph isomorphism
0 references
polynomial-time algorithm
0 references
0.7946100831031799
0 references
0.7934293746948242
0 references
0.7621806263923645
0 references
0.7522538900375366
0 references
0.7463511824607849
0 references
