On the influence of node centralities on graph edit distance for graph classification

DOI10.1007/978-3-319-18224-7_23MaRDI QIDQ3300153zbMATH OpenOpenAlexFDO

Authors Xavier Cortés, Carlos Francisco Moreno-García, F. Serratosa

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_23

zbMATH Keywords

graph edit distanceLevenshtein distancebipartite graph matchingfast bipartite graph matching

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Speeding up graph edit distance computation through fast bipartite matching
• Bipartite Graph Matching for Computing the Edit Distance of Graphs
• Structural pattern recognition with graph edit distance. Approximation algorithms and applications
• Approximation of graph edit distance in quadratic time
• Improving bipartite graph edit distance approximation using various search strategies

Cites work

• scientific article; zbMATH DE number 2090219 (Why is no real title available?)
• scientific article; zbMATH DE number 3240929 (Why is no real title available?)
• A one hour trip in the world of graphs, looking at the papers of the last ten years
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• Algorithms for the Assignment and Transportation Problems
• Graph-based representations and techniques for image processing and image analysis
• Interactive graph-matching using active query strategies
• Median graphs: A genetic approach based on new theoretical properties

Cited in

(4)

• An edit distance between graph correspondences
• Centroid based tree-structured data clustering using vertex/edge overlap and graph edit distance
• Speeding up graph edit distance computation through fast bipartite matching
• On the evaluation of graph centrality for shape matching

This page was built for publication: On the influence of node centralities on graph edit distance for graph classification

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