Wang Y-K; Fan K-C; Horng J-T ( Graph Edit Distance Computation): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(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")
 
No edit summary
 
Line 1: Line 1:
== Time Complexity ==  
== Time Complexity ==  


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


== Space Complexity ==  
== Space Complexity ==  

Latest revision as of 08:43, 10 April 2023

Time Complexity

$O(V E^{2} \log \log E)$

Space Complexity

()

Description

Genetics-based

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

1997

Reference

https://doi.org/10.1109/3477.604100