Wang Y-K; Fan K-C; Horng J-T ( 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 E^{2} loglogE)$ == Space Complexity == () == Description == Genetics-based == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1997 == Reference == https://doi.org/10.1109/3477.604100")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(V E^{2} loglogE)$

Space Complexity

()

Description

Genetics-based

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

1997

Reference

https://doi.org/10.1109/3477.604100

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Wang_Y-K;_Fan_K-C;_Horng_J-T_(_Graph_Edit_Distance_Computation)&oldid=45403"