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

From Algorithm Wiki
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