A graph matching method based on probes assignments

Romain Raveaux (1) , Jean-Christophe Burie (1) , Jean-Marc Ogier (1)

1 L3I - Laboratoire Informatique, Image et Interaction - EA 2118

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.

Mots clés: Graph matching; graph distance; minimum assignments; attributed graphs; attributed graphs.

Domaines: Algorithme et structure de données [cs.DS]

Romain Raveaux, Jean-Christophe Burie, Jean-Marc Ogier. A graph matching method based on probes assignments. 2008. ⟨hal-00305232v1⟩