1 paper
Nan Hu, Raif M. Rustamov, Leonidas Guibas
In this paper, we consider the weighted graph matching problem with partially disclosed correspondences between a number of anchor nodes. Our construction exploits recently introdu…