An edit distance between graph correspondences

DOI10.1007/978-3-319-58961-9_21MaRDI QIDQ5082160zbMATH OpenOpenAlexFDO

Authors Carlos Francisco Moreno-García, Xiaoyi Jiang, F. Serratosa

Publication date 15 June 2022

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

Full work available at URL https://rgu-repository.worktribe.com/output/228204

zbMATH Keywords

Hamming distanceedit distanceweighted meangraph correspondence

Mathematics Subject Classification ID

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

Recommendations

• Exploration of the labelling space given graph edit distance costs
• Weighted mean of a pair of graphs
• A survey of graph edit distance
• Distance patterns in structural similarity
• Approximation of graph edit distance based on Hausdorff matching

Cites work

• A distance measure between attributed relational graphs for pattern recognition
• A long trip in the charming world of graphs for pattern recognition
• A survey of graph edit distance
• A survey on tree edit distance and related problems
• Ensemble clustering by means of clustering embedding in vector spaces
• Generalized median graph computation by means of graph embedding in vector spaces
• On the influence of node centralities on graph edit distance for graph classification
• The String-to-String Correction Problem
• Weighted mean of a pair of graphs

Cited in

(7)

• Map edit distance versus graph edit distance for matching images
• ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS
• Exploration of the labelling space given graph edit distance costs
• Weighted mean of a pair of graphs
• Multicolor and directed edit distance
• Bipartite Graph Matching for Computing the Edit Distance of Graphs
• Edit Distance and Persistence Diagrams over Lattices

This page was built for publication: An edit distance between graph correspondences

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