Neuhaus, Riesen, Bunke (Inexact GED Graph Edit Distance Computation)
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