Graph matching based on similarities in structure and attributes - Laboratoire Jean Perrin
Pré-Publication, Document De Travail Année : 2024

Graph matching based on similarities in structure and attributes

Raphaël Candelier

Résumé

Finding vertex-to-vertex correspondences in real-world graphs is a challenging task with applications in a wide variety of domains. Structural matching based on graphs connectivities has attracted considerable attention, while the integration of all the other information stemming from vertices and edges attributes has been mostly left aside. Here we present the Graph Attributes and Structure Matching (GASM) algorithm, which provides high-quality solutions by integrating all the available information in a unified framework. Parameters quantifying the reliability of the attributes can tune how much the solutions should rely on the structure or on the attributes. We further show that even without attributes GASM consistently finds as-good-as or better solutions than state-of-the-art algorithms, with similar processing times.
Fichier principal
Vignette du fichier
Manuscript.pdf (1.27 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04797419 , version 1 (22-11-2024)

Identifiants

Citer

Raphaël Candelier. Graph matching based on similarities in structure and attributes. 2024. ⟨hal-04797419⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

More