A Novel Software Toolkit for Graph Edit Distance Computation
Authors:
- 1 January 2013
- book chapter
- Published by Springer Nature
- p. 142-151
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Fast Suboptimal Algorithms for the Computation of Graph Edit Distance2006
- Graph edit distance from spectral seriationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2005
- Reactive Tabu Search for Measuring Graph Similarity2005
- THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITIONInternational Journal of Pattern Recognition and Artificial Intelligence, 2004
- A Randomized Heuristic for Scene Recognition by Graph Matching2004
- An Error-Tolerant Approximate Matching Algorithm for Attributed Planar Graphs and Its Application to Fingerprint Classification2004
- Levenshtein distance for graph spectral features2004
- Spectral embedding of graphsPattern Recognition, 2003
- Graph Edit Distance with Node Splitting and Merging, and Its Application to Diatom Identification2003
- A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Transactions on Systems Science and Cybernetics, 1968