Solving Graph Matching with EDAs Using a Permutation-Based Representation
- 1 January 2002
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Least-commitment graph matching with genetic algorithmsPattern Recognition, 2001
- On fuzzy distances and their use in image processing under imprecisionPattern Recognition, 1999
- SYMBOLIC GRAPH MATCHING WITH THE EM ALGORITHMPattern Recognition, 1998
- Graph matching with a dual-step EM algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1998
- Structural matching by discrete relaxationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1997
- Matching delaunay graphsPattern Recognition, 1997
- A graduated assignment algorithm for graph matchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1996
- A Bayesian compatibility model for graph matchingPattern Recognition Letters, 1996
- Edge-labeling using dictionary-based relaxationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- A Note on the Generation of Random Normal DeviatesThe Annals of Mathematical Statistics, 1958