Approximation of graph edit distance in quadratic time (Q3300141)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7225076
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation of graph edit distance in quadratic time |
scientific article; zbMATH DE number 7225076 |
Statements
Approximation of Graph Edit Distance in Quadratic Time (English)
0 references
27 July 2020
0 references
greedy algorithm
0 references
cost matrix
0 references
greedy approach
0 references
quadratic time
0 references
assignment cost
0 references
0.8622238039970398
0 references
0.8460726737976074
0 references
0.8371174931526184
0 references
0.8330392241477966
0 references
