Babai (Graph Isomorphism, Bounded Number of Vertices of Each Color Graph Isomorphism Problem)

From Algorithm Wiki

Revision as of 08:57, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

o(\exp({2}n^{1/2}\log^{2}n))

Space Complexity

$O(n^{2})$ words

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

Description

Approximate?

Exact

Randomized?

No, deterministic

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_(Graph_Isomorphism,_Bounded_Number_of_Vertices_of_Each_Color_Graph_Isomorphism_Problem)&oldid=47044"