This variant of the graph matching problem provides an opportunity for the application of JOFC and also the adaptation of a state-of-the-art graph matching algorithm. My work on this variant of the graph matching problem constituted part of my dissertation research. This work is presented in this and this arxiv papers.
The code for the algorithm and analysis is at https://github.com/adalisan/SeededGraphMatch