A distance measure for large graphs based on prime graphs (Q531270)
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 6608886
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A distance measure for large graphs based on prime graphs |
scientific article; zbMATH DE number 6608886 |
Statements
A distance measure for large graphs based on prime graphs (English)
0 references
3 August 2016
0 references
graph similarity
0 references
graph decomposition
0 references
quotient graph
0 references
prime graph
0 references
edit distance
0 references
graph probing
0 references
0 references
0.7326509356498718
0 references
0.7115659713745117
0 references
0.6842827796936035
0 references
0.6842827796936035
0 references
0.6734251379966736
0 references
