X Chen (Exact GED Graph Edit Distance Computation)

From Algorithm Wiki
Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(VS)$ == Space Complexity == $O(wV^{2})$ words (Theorem 5, https://doi-org.ezproxy.canberra.edu.au/10.1016/j.knosys.2018.10.002) == Description == Beam Stack Search == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2019 == Reference == https://doi-org.ezproxy.canberra.edu.au/10.1016/j.knosys.2018.10.002")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(VS)$

Space Complexity

$O(wV^{2})$ words

(Theorem 5, https://doi-org.ezproxy.canberra.edu.au/10.1016/j.knosys.2018.10.002)

Description

Beam Stack Search

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2019

Reference

https://doi-org.ezproxy.canberra.edu.au/10.1016/j.knosys.2018.10.002

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=X_Chen_(Exact_GED_Graph_Edit_Distance_Computation)&oldid=45397"