On the use of similarity metrics for approximate graph matching (Q2883637)
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 6033985
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the use of similarity metrics for approximate graph matching |
scientific article; zbMATH DE number 6033985 |
Statements
On the use of similarity metrics for approximate graph matching (English)
0 references
13 May 2012
0 references
approximate graph matching
0 references
maximum common edge subgraph
0 references
similarity measure
0 references
heuristics
0 references
0.9095920324325562
0 references
0.8556474447250366
0 references
0.8556474447250366
0 references
0.8197289109230042
0 references
0.7971482276916504
0 references
