Abstract: We propose a novel fast graph matching approach based on a new formulation of the stable marriage problem, to measure the distance between graphs. The proposed approach is optimal in terms ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results