Babai 1980 (Graph Isomporhism, Trivalent Graphs Graph Isomorphism Problem)

From Algorithm Wiki
Revision as of 12:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == \exp(cn^{\frac{1}{2}} \log n) == Space Complexity == $O(n^{2})$ words (https://epubs.siam.org/doi/epdf/10.1137/0209018) == Description == == Approximate? == Exact == Randomized? == Yes, Las Vegas == Model of Computation == Word RAM == Year == 1980 == Reference == https://epubs.siam.org/doi/10.1137/0209018")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

\exp(cn^{\frac{1}{2}} \log n)

Space Complexity

$O(n^{2})$ words

(https://epubs.siam.org/doi/epdf/10.1137/0209018)

Description

Approximate?

Exact

Randomized?

Yes, Las Vegas

Model of Computation

Word RAM

Year

1980

Reference

https://epubs.siam.org/doi/10.1137/0209018

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Babai_1980_(Graph_Isomporhism,_Trivalent_Graphs_Graph_Isomorphism_Problem)&oldid=45706"