1. A. Albarelli, F. Bergamasco, L. Rossi, S. Vascon, and A. Torsello (2012) A stable graph-based representation for object recognition through high-order matching. In Proceedings of the 21st International Conference on Pattern Recognition, ICPR 2012, Tsukuba, Japan, November 11–15, 2012, pages 3341–3344
2. A. Barducci and S. Marinai (2012) Object recognition in floor plans by graphs of white connected components. In Proceedings of the 21st International Conference on Pattern Recognition. ICPR 2012, Tsukuba, Japan, November 11–15, 2012, pages 298–301
3. Chen G, Zhu Z (2012) The number of independent sets of unicyclic graphs with given matching number. Discret Appl Math 160(1–2):108–115
4. M. Cho, J. Lee, and K. M. Lee (2010) Reweighted random walks for graph matching. In Computer Vision - ECCV 2010 - 11th European Conference on Computer Vision, Heraklion, Crete, Greece, September 5–11, 2010, Proceedings, Part V, pages 492–505
5. M. Cho, J. Sun, O. Duchenne, and J. Ponce (2014) Finding matches in a haystack: A max-pooling strategy for graph matching in the presence of outliers. In 2014 I.E. Conference on Computer Vision and Pattern Recognition, CVPR 2014, Columbus, OH, USA, June 23–28, 2014, pages 2091–2098