Neuhaus, Riesen, Bunke (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 12:1512:15, 15 February 2023‎ Admin talk contribs‎ 363 bytes +363‎ 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"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Neuhaus,_Riesen,_Bunke_(Inexact_GED_Graph_Edit_Distance_Computation)"