• Publications
  • Influence
Inexact graph matching by means of estimation of distribution algorithms
We propose to use EDA algorithms as a new approach for inexact graph matching which is NP-hard and requires techniques to find an approximate acceptable solution. Expand
  • 96
  • 5
  • PDF
Comparando mapas conceituais utilizando correspondência de grafos
The problem of graph correspondence consists of a mathematical formulation for model-based image recognition. Expand
  • 4
Model-based scene recognition using graph fuzzy homomorphism solvedby genetic
We present in this paper a new formalism for graph matching, based on fuzzy homomorphism. Expand