Finch (Inexact GED Graph Edit Distance Computation): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 11:1511:15, 15 February 2023Admin talk contribs 531 bytes +531 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.ezproxy.canberra.edu.au/neco/article-pdf/10/7/1873/813998/089976698300017188.pdf?casa_token=nCYv9xO_Cc4AAAAA:EHiG4v8QmQju6u9..."