1 paper · 1 filter
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…