K Riesen (Inexact GED Graph Edit Distance Computation)
Revision as of 12:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{2})$ == Space Complexity == $O(V)$ words (Space complexity of A*) == Description == A* with bipartite heuristic == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2013 == Reference == https://doi.org/10.1007/978-3-642-38221-5_15")
Time Complexity
$O(V^{2})$
Space Complexity
$O(V)$ words
(Space complexity of A*)
Description
A* with bipartite heuristic
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2013