Graph matching encompasses a class of computational problems aimed at identifying a correspondence between the vertex sets of two graphs so as to maximise structural similarity or alignment. Exact ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results