Muzychuk (Circulant graphs Graph Isomorphism Problem)

From Algorithm Wiki
Revision as of 11: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/doi/abs/10.1112/S0024611503014412")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Muzychuk_(Circulant_graphs_Graph_Isomorphism_Problem)&oldid=45471"