An Error-Tolerant Approximate Matching Algorithm for Attributed Planar Graphs and Its Application to Fingerprint Classification
- 1 January 2004
- conference paper
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Graph Edit Distance with Node Splitting and Merging, and Its Application to Diatom IdentificationLecture Notes in Computer Science, 2003
- On Graphs with Unique Node LabelsLecture Notes in Computer Science, 2003
- Graph distances using graph unionPattern Recognition Letters, 2001
- A graph distance metric combining maximum common subgraph and minimum common supergraphPattern Recognition Letters, 2001
- A new algorithm for error-tolerant subgraph isomorphism detectionIEEE Transactions on Pattern Analysis and Machine Intelligence, 1998
- A graph distance metric based on the maximal common subgraphPattern Recognition Letters, 1998
- Applications of approximate string matching to 2D shape recognitionPattern Recognition, 1993
- A distance measure between attributed relational graphs for pattern recognitionIEEE Transactions on Systems, Man, and Cybernetics, 1983
- Isomorphism of graphs of bounded valence can be tested in polynomial timeJournal of Computer and System Sciences, 1982
- Linear time algorithm for isomorphism of planar graphs (Preliminary Report)Published by Association for Computing Machinery (ACM) ,1974