X Chen (Exact GED Graph Edit Distance Computation)
Revision as of 12: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/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/10.1016/j.knosys.2018.10.002")
Time Complexity
$O(VS)$
Space Complexity
$O(wV^{2})$ words
(Theorem 5, https://doi.org/10.1016/j.knosys.2018.10.002)
Description
Beam Stack Search
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2019