On the Influence of Node Centralities on Graph Edit Distance for Graph Classification

DOI10.1007/978-3-319-18224-7_23zbMath1437.68137OpenAlexW2408708578MaRDI QIDQ3300153

Carlos Francisco Moreno-García, Xavier Cortés, Francesc 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

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

Related Items (1)

An Edit Distance Between Graph Correspondences

Cites Work

• Unnamed Item
• Unnamed Item
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• Interactive graph-matching using active query strategies
• Median graphs: A genetic approach based on new theoretical properties
• Algorithms for the Assignment and Transportation Problems
• A One Hour Trip in the World of Graphs, Looking at the Papers of the Last Ten Years
• Graph-based representations and techniques for image processing and image analysis

This page was built for publication: On the Influence of Node Centralities on Graph Edit Distance for Graph Classification