A graph matching method based on probe assignments

In this paper, a graph matching method and a distance between at- tributed graphs are defined. Both approaches are based on graph probes. Probes can be seen as features exctracted from a given graph. They represent a local information. According two graphs G1,G2, the univalent mapping can be ex- presssed as the minimum-weight probe matching between G1 and G2 with re- spect to the cost function c.