Using local similarity measures to efficiently address approximate graph matching (Q496650)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Using local similarity measures to efficiently address approximate graph matching |
scientific article; zbMATH DE number 6484189
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using local similarity measures to efficiently address approximate graph matching |
scientific article; zbMATH DE number 6484189 |
Statements
Using local similarity measures to efficiently address approximate graph matching (English)
0 references
22 September 2015
0 references
approximate graph matching
0 references
local similarity measure
0 references
local search
0 references
0 references
0.9095920324325562
0 references
0.8451294898986816
0 references
0.8451294898986816
0 references
0.8117284774780273
0 references
0.7867775559425354
0 references
