Muzychuk (Circulant graphs Graph Isomorphism Problem)
Jump to navigation
Jump to search
Time Complexity
$O(n^{2})$
Space Complexity
$O(n^{2})$ words
(derived in notes)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2004
Reference
https://londmathsoc.onlinelibrary.wiley.com/doi/abs/10.1112/S0024611503014412