Comparing large graphs efficiently by margins of feature vectors (Q2372051)
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 5170438
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparing large graphs efficiently by margins of feature vectors |
scientific article; zbMATH DE number 5170438 |
Statements
Comparing large graphs efficiently by margins of feature vectors (English)
0 references
10 July 2007
0 references
graph similarity
0 references
directed and undirected graphs
0 references
degree vectors
0 references
similarity measures
0 references
0.8115705847740173
0 references
0.7921447157859802
0 references
0.7903608679771423
0 references
0.7854767441749573
0 references
0.7697017788887024
0 references
