Wednesday 23 July 2008, by Romain Raveaux
In this paper, a graph matching method and a distane between attributed 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 expressed as the minimum-weight probe matching between G1 and G2 with respect to a cost function.
The article is available here : Reference : http://hal.archives-ouvertes.fr/hal-00305232/fr/
Click here to run the Online Application : Java Web Application : Run It !!
Click here to download the application : EXE Version Download !!
Click here to download the graph databases : Graph dataset!!