graph (network) algorithm
-
Updated
Nov 22, 2021 - Jupyter Notebook
graph (network) algorithm
Eigenvector-based graph matching algorithm for computing node similarity between graphs with PageRank-style iterative optimization.
Add a description, image, and links to the node-similarity topic page so that developers can more easily learn about it.
To associate your repository with the node-similarity topic, visit your repo's landing page and select "manage topics."