X Chen (Exact GED Graph Edit Distance Computation)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(VS)$

Space Complexity

$O(wV^{2})$ words

(Theorem 5, https://doi.org/10.1016/j.knosys.2018.10.002)

Description

Beam Stack Search

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2019

Reference

https://doi.org/10.1016/j.knosys.2018.10.002