A graph matching method based on probe assignments - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2008

A graph matching method based on probe assignments

Résumé

In this paper, a graph matching method and a distance 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.
Fichier principal
Vignette du fichier
GMPA1.pdf (302.19 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00305232 , version 1 (23-07-2008)
hal-00305232 , version 2 (23-07-2008)
hal-00305232 , version 3 (25-08-2008)

Identifiants

  • HAL Id : hal-00305232 , version 3

Citer

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

Collections

L3I UNIV-ROCHELLE
85 Consultations
158 Téléchargements

Partager

Gmail Facebook X LinkedIn More