Using local similarity measures to efficiently address approximate graph matching

DOI10.1016/j.dam.2012.01.019zbMath1321.05208OpenAlexW2069543418MaRDI QIDQ496650

Philippe Galinier, Segla Kpodjedo, Giulio Antoniol

Publication date: 22 September 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.01.019

zbMATH Keywords

local searchapproximate graph matchinglocal similarity measure

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph isomorphism, general remarks
• A comparative study of ant colony optimization and reactive search for graph matching problems
• On the use of similarity metrics for approximate graph matching
• Algorithms for the Assignment and Transportation Problems
• An eigendecomposition approach to weighted graph matching problems
• Tabu Search—Part I
• RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
• A distance measure between attributed relational graphs for pattern recognition
• Maintaining traceability links during object-oriented software evolution

This page was built for publication: Using local similarity measures to efficiently address approximate graph matching