3 papers
math.OC2026
Regularized Coupling Maps on Matrix Polytopes: From Assignment to Graph Matching and Optimal Transport
Binrui Shen, Shengxin Zhu
Three classical problems-linear assignment, graph matching, and optimal transport-share a common structure: they seek an optimal matrix-valued coupling on a matrix polytope. We stu…
cs.LG2025
FRAM: Frobenius-Regularized Assignment Matching with Mixed-Precision Computing
Binrui Shen, Yuan Liang, Shengxin Zhu
Graph matching, typically formulated as a Quadratic Assignment Problem (QAP), seeks to establish node correspondences between two graphs. To address the NP-hardness of QAP, some ex…
math.CO2023
Lightning graph matching
Binrui. shen, Qiang. niu, Shengxin. zhu
Graph matching aims to find correspondences between two graphs. It is a fundamental task in pattern recognition. The classical spectral matching algorithm has time complexity $\mat…