Bodlaender (Partial k-trees Graph Isomorphism Problem)

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Bodlaender_(Partial_k-trees_Graph_Isomorphism_Problem)&oldid=45473"