On the use of similarity metrics for approximate graph matching

DOI10.1016/j.endm.2010.05.087zbMath1237.90264OpenAlexW2026869383MaRDI QIDQ2883637

Philippe Galinier, Segla Kpodjedo, Giulio Antoniol

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.087

zbMATH Keywords

heuristicssimilarity measureapproximate graph matchingmaximum common edge subgraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

On the use of similarity metrics for approximate graph matching ⋮ Using local similarity measures to efficiently address approximate graph matching

Cites Work

• On the use of similarity metrics for approximate graph matching
• RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs

This page was built for publication: On the use of similarity metrics for approximate graph matching