Speeding up graph edit distance computation through fast bipartite matching (Q3003453)
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 5900321
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Speeding up graph edit distance computation through fast bipartite matching |
scientific article; zbMATH DE number 5900321 |
Statements
Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching (English)
0 references
27 May 2011
0 references
0.952516794204712
0 references
0.8622238039970398
0 references
0.8384169936180115
0 references
0.8346367478370667
0 references
0.8251150846481323
0 references
