Exact Computation of Graph Edit Distance for Uniform and Non-uniform Metric Edit Costs

DOI10.1007/978-3-319-58961-9_19zbMath1489.68182OpenAlexW2613296560MaRDI QIDQ5082158

Johann Gamper, David B. Blumenthal

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_19

zbMATH Keywords

branch and boundgraph matchinggraph edit distancegraph similarity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Pattern recognition, speech recognition (68T10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Fast similarity search for graphs by edit distance

Cites Work

• Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching
• Unnamed Item

This page was built for publication: Exact Computation of Graph Edit Distance for Uniform and Non-uniform Metric Edit Costs