Improved Graph Edit Distance Approximation with Simulated Annealing

DOI10.1007/978-3-319-58961-9_20zbMath1489.68203OpenAlexW2613423459MaRDI QIDQ5082159

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)

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Structural pattern recognition with graph edit distance. Approximation algorithms and applications
• Improving bipartite graph edit distance approximation using various search strategies
• Two New Graph Kernels and Applications to Chemoinformatics
• Assignment Problems
• Inexact graph matching for structural pattern recognition
• Equation of State Calculations by Fast Computing Machines

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