L Chang (Inexact GED Graph Edit Distance Computation)
Jump to navigation
Jump to search
Time Complexity
$O(V E^{2} logV)$
Space Complexity
$O(V)$ words
(Theorem 5.1, and the bound on T_{\leq \delta ...} is V\log V https://doi.org/10.48550/arXiv.1709.06810)
Description
AStar+
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2017