Approximation of Graph Edit Distance in Quadratic Time

DOI10.1007/978-3-319-18224-7_1zbMath1437.68140OpenAlexW1911005089MaRDI QIDQ3300141

Kaspar Riesen, Andreas Fischer, M. Ferrer, Horst Bunke

Publication date: 27 July 2020

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-18224-7_1

zbMATH Keywords

greedy algorithmquadratic timegreedy approachcost matrixassignment cost

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (2)

Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching ⋮ EmbAssi: embedding assignment costs for similarity search in large graph databases

Cites Work

• A survey of graph edit distance
• Algorithms for the Assignment and Transportation Problems
• Assignment Problems
• Inexact graph matching for structural pattern recognition
• A distance measure between attributed relational graphs for pattern recognition
• Graph-Based Representations in Pattern Recognition

This page was built for publication: Approximation of Graph Edit Distance in Quadratic Time