K Riesen (Inexact GED Graph Edit Distance Computation)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(V^{2})$

Space Complexity

$O(V)$ words

(Space complexity of A*)

Description

A* with bipartite heuristic

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2013

Reference

https://doi.org/10.1007/978-3-642-38221-5_15