K Riesen (Inexact 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(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.ezproxy.canberra.edu.au/10.1007/978-3-642-38221-5_15")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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.ezproxy.canberra.edu.au/10.1007/978-3-642-38221-5_15

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