Approximate matching of neighborhood subgraphs -- an ordered string graph Levenshtein method (Q4600527)
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: Approximate matching of neighborhood subgraphs -- an ordered string graph Levenshtein method |
scientific article; zbMATH DE number 6824621
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate matching of neighborhood subgraphs -- an ordered string graph Levenshtein method |
scientific article; zbMATH DE number 6824621 |
Statements
Approximate Matching of Neighborhood Subgraphs — An Ordered String Graph Levenshtein Method (English)
0 references
11 January 2018
0 references
sub-graph matching
0 references
online social networks
0 references
tree representation
0 references
string representation
0 references
edit distance
0 references
0.7433702945709229
0 references
0.7433702945709229
0 references
0.7282376885414124
0 references
0.7281779050827026
0 references
0.7262616753578186
0 references
