Bodlaender (Partial k-trees Graph Isomorphism Problem): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 11:1611:16, 15 February 2023‎ Admin talk contribs‎ 317 bytes +317‎ 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.ezproxy.canberra.edu.au/science/article/pii/0196677490900135"
Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Bodlaender_(Partial_k-trees_Graph_Isomorphism_Problem)"