Tao D; Tang X; Li X et al ( Graph Edit Distance Computation)

From Algorithm Wiki

Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{2})$ == Space Complexity == () == Description == EDH == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2006 == Reference == https://eprints.bbk.ac.uk/id/eprint/443/1/Binder1.pdf")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(V^{2})$

Space Complexity

()

Description

EDH

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

2006

Reference

https://eprints.bbk.ac.uk/id/eprint/443/1/Binder1.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Tao_D;_Tang_X;_Li_X_et_al_(_Graph_Edit_Distance_Computation)&oldid=45404"