Comparisons of attributed graph matching algorithms for computer vision

14 not able to look for graph isomorphisms. The Ullmann algorithm is quick and simple, but only suitable for nonattributed graphs. In the future, graph matching algorithms could be developed using parallel computing. Applications of neural networks and VLSI implementation techniques can also open new chances.