Muzychuk (Circulant graphs Graph Isomorphism Problem): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 12:1612:16, 15 February 2023‎ Admin talk contribs‎ 341 bytes +341‎ 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"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Muzychuk_(Circulant_graphs_Graph_Isomorphism_Problem)"