Node Matching Computation Between Two Large Graphs in Linear Computational Cost (Q5082148)
From MaRDI portal
scientific article; zbMATH DE number 7542177
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
