Schmidt & Druffel ( 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*n!)$ == Space Complexity == $O(n^{2})$ words (derived in sheet) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1976 == Reference == https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/321958.321963")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n*n!)$

Space Complexity

$O(n^{2})$ words

(derived in sheet)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1976

Reference

https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/321958.321963

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Schmidt_%26_Druffel_(_Graph_Isomorphism_Problem)&oldid=45468"