A graph matching method and a graph matching distance based on subgraph assignments
Authors:
- 1 April 2010
- journal article
- research article
- Published by Elsevier in Pattern Recognition Letters
- Vol. 31 (5) , 394-406
Abstract
No abstract availableKeywords
This publication has 48 references indexed in Scilit:
- Inexact graph matching using a genetic algorithm for image recognitionPattern Recognition Letters, 2007
- Automatic learning of cost functions for graph edit distanceInformation Sciences, 2007
- Graph kernels for chemical informaticsNeural Networks, 2005
- Inexact graph matching by means of estimation of distribution algorithmsPattern Recognition, 2002
- A surface-based approach to 3-D object recognition using a mean field annealing neural networkPattern Recognition, 2002
- A decision tree approach to graph and subgraph isomorphism detectionPattern Recognition, 1999
- Matching delaunay graphsPattern Recognition, 1997
- A Bayesian compatibility model for graph matchingPattern Recognition Letters, 1996
- Pattern recognition by graph matching using the Potts MFT neural networksPattern Recognition, 1995
- Pattern recognition by homomorphic graph matching using Hopfield neural networksImage and Vision Computing, 1995