An Edit Distance Between Graph Correspondences
From MaRDI portal
Publication:5082160
DOI10.1007/978-3-319-58961-9_21zbMath1489.68199MaRDI QIDQ5082160
Xiaoyi Jiang, Carlos Francisco Moreno-García, Francesc 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
68R10: Graph theory (including graph drawing) in computer science
Cites Work
- A survey on tree edit distance and related problems
- A survey of graph edit distance
- Ensemble clustering by means of clustering embedding in vector spaces
- Generalized median graph computation by means of graph embedding in vector spaces
- A long trip in the charming world of graphs for pattern recognition
- On the Influence of Node Centralities on Graph Edit Distance for Graph Classification
- The String-to-String Correction Problem
- A distance measure between attributed relational graphs for pattern recognition
- Weighted mean of a pair of graphs