Babai and Luks (Graph Isomorphism, General Graphs Graph Isomorphism Problem)
Jump to navigation
Jump to search
Time Complexity
\exp(n^{\frac{1}{2} + o({1})})
Space Complexity
words
()
Description
Construct canonical forms of graphs and compare
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1983
Reference
https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/800061.808746