Muzychuk (Circulant graphs Graph Isomorphism Problem)
Revision as of 12:16, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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.ezproxy.canberra.edu.au/doi/abs/10.1112/S0024611503014412")
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