On the influence of node centralities on graph edit distance for graph classification
DOI10.1007/978-3-319-18224-7_23zbMATH Open1437.68137OpenAlexW2408708578MaRDI QIDQ3300153FDOQ3300153
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
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
Pattern recognition, speech recognition (68T10) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Title not available (Why is that?)
- Algorithms for the Assignment and Transportation Problems
- Median graphs: A genetic approach based on new theoretical properties
- Graph-based representations and techniques for image processing and image analysis
- Title not available (Why is that?)
- Interactive graph-matching using active query strategies
- A one hour trip in the world of graphs, looking at the papers of the last ten years
Cited In (4)
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)
