As for the future work, we are planning applications of the neighbor matching method in real-world problems in bioinformatics, text classification, and other domains suitable for graph similarity techniques.

## Acknowledgements

This work was partially supported by Serbian Ministry of Science grant 144030.

## References

[1] J. M. Kleinberg, Authoritative sources in a hyperlinked environment, Journal of the ACM 46 (5) (1999) 604–632.

[2] M. Heymans, A. K. Singh, Deriving phylogenetic trees from the similarity analysis of metabolic pathways, Bioinformatics 19 (suppl 1) (2003) i138–
146.
[3] V. D. Blondel, A. Gajardo, M. Heymans, P. Senellart, P. V. Dooren, A
measure of similarity between graph vertices: Applications to synonym extraction and web searching, SIAM Review 46 (4) (2004) 647–666.

[4] L. Zager, G. Verghese, Graph similarity scoring and matching, Applied Mathematics Letters 21 (1) (2008) 86–94.

[5] S. Melnik, H. Garcia-Molina, E. Rahm, Similarity flooding: A versatile graph matching algorithm and its application to schema matching, in:
ICDE '02: Proceedings of the 18th International Conference on Data Engineering, IEEE Computer Society, Washington, DC, 2002, pp. 117–128.

[6] E. A. Leicht, P. Holme, M. E. J. Newman, Vertex similarity in networks, Physical Review E 73 (2) (2006) 026120+.

[7] P. Erd˝os, A. R´enyi, On random graphs, Publicationes Mathematicae 6
(1959) 290–297.

[8] H. W. Kuhn, The hungarian method for the assignment problem, Naval Research Logistics Quarterly 2 (1-2) (1955) 83–97.

[9] J. Edmonds, R. M. Karp, Theoretical improvements in algorithmic efficiency for network flow problems, Journal of the ACM 19 (2) (1972) 248–
264.

[10] M. L. Fredman, R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the ACM 34 (3) (1987) 596–
615.