Tools for Graph Matching
Spectral Graph Matching Methods: IsoRank Algorithm
splr "Matrix" as character
Rank best matches
Center adjacency matrix
Get Permutation
Parameter checking for a graph-pair
Standardize seeds input data type
Check the similarity matrix passed to a matching function
Linear (sum) assignment problem
Graph Matching Methods
Frank-Wolfe Graph Matching Methods
Percolation Graph Matching Methods
Spectral Graph Matching Methods: Umeyama Algorithm
Graph matching results class
Methods for the graphMatch class
Operator methods for graphMatch objects
Summary methods for graphMatch objects
iGraphMatch: Tools for Graph Matching
Initialization of the start matrix
Matrix inner products
Solves a linear assignment problem using the Jonker-Vogenant algorithm...
Find the largest common connected subgraph (LCCS) of two graphs
Lists of Matrices
Pad a matrix object with extra rows/columns of 0s.
Plotting methods for visualizing matches
Sample correlated G(n,p) random graphs
Sample graphs from edge probability matrix and correlation matrix
Sample graphs pair from stochastic block model
Split an igraph object into aligned graphs by attribute
Sparse Plus Low-Rank Matrices
Add a constant to a splrMatrix object
Convert splr "Matrix" to Sparse
"SPLR" Methods
Versatile tools and data for graph matching analysis with various forms of prior information that supports working with 'igraph' objects, matrix objects, or lists of either.
Useful links