Error-tolerant graph matching: A formal framework and algorithms
- 1 January 1998
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Automatic knowledge acquisition for spatial document interpretationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On a relation between graph edit distance and maximum common subgraphPattern Recognition Letters, 1997
- Classes of cost functions for string edit distanceAlgorithmica, 1997
- Recent Advances in Graph MatchingInternational Journal of Pattern Recognition and Artificial Intelligence, 1997
- STRUCTURAL AND SYNTACTIC PATTERN RECOGNITIONPublished by World Scientific Pub Co Pte Ltd ,1993
- Structural Descriptions and Inexact MatchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern AnalysisIEEE Transactions on Systems, Man, and Cybernetics, 1979
- An Algorithm for Subgraph IsomorphismJournal of the ACM, 1976
- The String-to-String Correction ProblemJournal of the ACM, 1974
- A note on the derivation of maximal common subgraphs of two directed or undirected graphsCalcolo, 1973