Computing approximate tree edit distance using relaxation labeling
- 1 May 2003
- journal article
- Published by Elsevier in Pattern Recognition Letters
- Vol. 24 (8) , 1089-1097
- https://doi.org/10.1016/s0167-8655(02)00255-6
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Mean and maximum common subgraph of two graphsPattern Recognition Letters, 2000
- Matching hierarchical structures using association graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1999
- Shock Graphs and Shape MatchingInternational Journal of Computer Vision, 1999
- Continuous Characterizations of the Maximum Clique ProblemMathematics of Operations Research, 1997
- The Dynamics of Nonlinear Relaxation Labeling ProcessesJournal of Mathematical Imaging and Vision, 1997
- An Image Understanding System Using Attributed Symbolic Representation and Inexact Graph-MatchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- The Tree-to-Tree Correction ProblemJournal of the ACM, 1979
- Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern AnalysisIEEE Transactions on Systems, Man, and Cybernetics, 1979
- Subgraph isomorphism, matching relational structures and maximal cliquesInformation Processing Letters, 1976
- Maxima for Graphs and a New Proof of a Theorem of TuránCanadian Journal of Mathematics, 1965