This is a Python implementation of the Doubly Stochastic Projected Fixed Point (DSPFP) algorithm for the approximate solution of the Quadratic Assignment Problem (QAP) / Graph Matching (GM). the DSPFP was proposed in:
Yao Lu, Kaizhu Huang, and Cheng-Lin Liu. Doubly stochastic projected Fixed-Point algorithm for large graph matching. Pattern Recognition, July 2016.
http://dx.doi.org/10.1016/j.patcog.2016.07.015
Related pre-print, from 2012, where the same algorithm was named fastPFP: