Exact GED
The GED of two graphs is defined as the minimum cost of an edit path between them, where an edit path is a sequence of edit operations (inserting, deleting, and relabeling vertices or edges) that transforms one graph into another. Exact GED computes the GED exactly.
Parameters
- : number of vertices in the larger of the two graphs
Filters
Computational Model
Randomization
Approximation
Algorithms Table
Displaying 1 of 1 algorithms
| See more | ||||
|---|---|---|---|---|
| X Chen | 2019 |
Reductions Table
Insuffient Data to display table
Other relevant algorithms
Insuffient Data to display table