Neuhaus, Riesen, Bunke (Inexact GED Graph Edit Distance Computation)

From Algorithm Wiki
Revision as of 12:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{2})$ == Space Complexity == $O(wV)$ words (Derived: number of nodes under consideration at once) == Description == A*-Beamsearch == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2006 == Reference == https://link.springer.com/chapter/10.1007/11815921_17")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(V^{2})$

Space Complexity

$O(wV)$ words

(Derived: number of nodes under consideration at once)

Description

A*-Beamsearch

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2006

Reference

https://link.springer.com/chapter/10.1007/11815921_17

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Neuhaus,_Riesen,_Bunke_(Inexact_GED_Graph_Edit_Distance_Computation)&oldid=45402"