On the influence of node centralities on graph edit distance for graph classification (Q3300153)
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: On the influence of node centralities on graph edit distance for graph classification |
scientific article; zbMATH DE number 7225098
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the influence of node centralities on graph edit distance for graph classification |
scientific article; zbMATH DE number 7225098 |
Statements
On the Influence of Node Centralities on Graph Edit Distance for Graph Classification (English)
0 references
27 July 2020
0 references
graph edit distance
0 references
bipartite graph matching
0 references
fast bipartite graph matching
0 references
Levenshtein distance
0 references
0.8384169936180115
0 references
0.8374072313308716
0 references
0.7827820777893066
0 references
0.7689610719680786
0 references
0.7686957120895386
0 references
