article · 15/11/2025
Graph matching based on similarities in structure and attributes
Voir chez l’éditeurArticle en PDF
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.
Citer cet article
Candelier, R. (2025). Graph matching based on similarities in structure and attributes. Journal of Graph Algorithms and Applications, 29(1), 289-320. https://doi.org/10.7155/jgaa.v29i1.2979@article{Candelier2025_462,
author = {Candelier, Raphaël},
year = {2025},
month = {11},
title = {Graph matching based on similarities in structure and attributes},
journal = {Journal of Graph Algorithms and Applications},
volume = {29},
number = {1},
pages = {289-320},
abstract = {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.},
url = {https://jgaa.info/index.php/jgaa/article/view/2979},
doi = {10.7155/jgaa.v29i1.2979},
}TY - JOUR
AU - Candelier, Raphaël
PY - 2025
DA - 2025/11/15
TI - Graph matching based on similarities in structure and attributes
JO - Journal of Graph Algorithms and Applications
VL - 29
IS - 1
AB - 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.
SP - 289
EP - 320
DO - 10.7155/jgaa.v29i1.2979
UR - https://jgaa.info/index.php/jgaa/article/view/2979
ER -