McKay ( Graph Isomorphism Problem)
Jump to navigation
Jump to search
Time Complexity
$O((m1 + m2)n^{3} + m2 n^{2} L)$
Space Complexity
${2}mn+{10}n+m+(m+{4})K+{2}mL$ words
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1981