Node matching computation between two large graphs in linear computational cost (Q5082148)
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 7542177
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Node matching computation between two large graphs in linear computational cost |
scientific article; zbMATH DE number 7542177 |
Statements
Node Matching Computation Between Two Large Graphs in Linear Computational Cost (English)
0 references
15 June 2022
0 references
large graph matching
0 references
graph edit distance
0 references
bipartite graph matching
0 references
0 references
0.7446038126945496
0 references
0.7338035106658936
0 references
0.7262616753578186
0 references
0.7176517248153687
0 references
0.7164339423179626
0 references
