Bodlaender (Partial k-trees Graph Isomorphism Problem)
Jump to navigation
Jump to search
Time Complexity
$O(n^{(k+{4.5})})$
Space Complexity
check words
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1990
Reference
https://www.sciencedirect.com/science/article/pii/0196677490900135