Finch (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} E)$ == Space Complexity == $O(V^{2})$? words (Seems to store/update a constant number of values per pair of nodes (one from each graph)) == Description == energy-based == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1998 == Reference == https://direct.mit.edu/neco/article-pdf/10/7/1873/813998/089976698300017188.pdf?casa_token=nCYv9xO_Cc4AAAAA:EHiG4v8QmQju6u9...")
Time Complexity
$O(V^{2} E)$
Space Complexity
$O(V^{2})$? words
(Seems to store/update a constant number of values per pair of nodes (one from each graph))
Description
energy-based
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1998