Generalizing Graph Matching beyond Quadratic Assignment Model

In this paper, we show that a large family of functions, defined as Separable Functions, can asymptotically approximate the discrete matching problem by varying the approximation controlling parameters.