pygmtools.classic_solvers
Classic (learning-free) two-graph matching solvers. These two-graph matching solvers are recommended to solve matching problems with two explicit graphs, or problems formulated as Quadratic Assignment Problem (QAP).
The two-graph matching problem considers both nodes and edges, formulated as a QAP:
\[\begin{split}&\max_{\mathbf{X}} \ \texttt{vec}(\mathbf{X})^\top \mathbf{K} \texttt{vec}(\mathbf{X})\\
s.t. \quad &\mathbf{X} \in \{0, 1\}^{n_1\times n_2}, \ \mathbf{X}\mathbf{1} = \mathbf{1}, \ \mathbf{X}^\top\mathbf{1} \leq \mathbf{1}\end{split}\]
Functions
Integer Projected Fixed Point (IPFP) method for graph matching (QAP). |
|
Reweighted Random Walk Matching (RRWM) solver for graph matching (QAP). |
|
Spectral Graph Matching solver for graph matching (QAP). |