On a relation between graph edit distance and maximum common subgraph
- 1 August 1997
- journal article
- Published by Elsevier in Pattern Recognition Letters
- Vol. 18 (8) , 689-694
- https://doi.org/10.1016/s0167-8655(97)00060-3
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Structural matching in computer vision using probabilistic relaxationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1995
- Rulegraphs for graph matching in pattern recognitionPattern Recognition, 1994
- Model matching in robot vision by subgraph isomorphismPattern Recognition, 1992
- Hierarchical attributed graph representation and recognition of handwritten chinese charactersPattern Recognition, 1991
- Attributed stroke graph matching for seal imprint verificationPattern Recognition Letters, 1989
- Stereo correspondence through feature grouping and maximal cliquesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Inexact graph matching for structural pattern recognitionPattern Recognition Letters, 1983
- The graph isomorphism diseaseJournal of Graph Theory, 1977
- An Algorithm for Subgraph IsomorphismJournal of the ACM, 1976
- The String-to-String Correction ProblemJournal of the ACM, 1974