Improved Graph Edit Distance Approximation with Simulated Annealing

DOI10.1007/978-3-319-58961-9_20MaRDI QIDQ5082159zbMATH OpenOpenAlexFDO

Authors Kaspar Riesen, Andreas Fischer, Horst Bunke

Publication date 15 June 2022

Published in Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-58961-9_20

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)

Recommendations

• Improving bipartite graph edit distance approximation using various search strategies
• The edit distance in graphs: methods, results, and generalizations
• Approximation of graph edit distance based on Hausdorff matching
• A Quadratic Programming Approach to the Graph Edit Distance Problem
• A survey of graph edit distance
• Approximation of graph edit distance in quadratic time

Cites work

• Assignment Problems
• Equation of state calculations by fast computing machines
• scientific article; zbMATH DE number 2043351 (Why is no real title available?)
• Improving bipartite graph edit distance approximation using various search strategies
• Inexact graph matching for structural pattern recognition
• Optimization by simulated annealing
• Structural pattern recognition with graph edit distance. Approximation algorithms and applications
• Two new graph kernels and applications to chemoinformatics

Cited in

(8)

• A local branching heuristic for solving a graph edit distance problem
• Convex graph invariant relaxations for graph edit distance
• On the use of similarity metrics for approximate graph matching
• Exploration of the labelling space given graph edit distance costs
• A novel software toolkit for graph edit distance computation
• Using local similarity measures to efficiently address approximate graph matching
• A Quadratic Programming Approach to the Graph Edit Distance Problem
• A survey of graph edit distance

This page was built for publication: Improved Graph Edit Distance Approximation with Simulated Annealing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5082159)