Babai and Luks (Graph Isomorphism, General Graphs Graph Isomorphism Problem)

From Algorithm Wiki
Revision as of 12:16, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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/doi/10.1145/800061.808746")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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/doi/10.1145/800061.808746

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Babai_and_Luks_(Graph_Isomorphism,_General_Graphs_Graph_Isomorphism_Problem)&oldid=45464"