M. Kuramochi and G. Karypis, Finding Frequent Patterns in a Large Sparse Graph*, Data Mining and Knowledge Discovery, vol.4, issue.1, pp.243-271, 2005.
DOI : 10.1007/s10618-005-0003-9

A. Inokuchi, T. Washio, and H. Motoda, Complete mining of frequent patterns from graphs: Mining graph data, Machine Learning, vol.50, issue.3

E. Barbu, P. Héroux, S. Adam, and E. Trupin, Frequent graph discovery: Application to line drawing document images, Electronic Letters on Computer Vision and Image Analysis (ELCVIA), vol.5, issue.2, pp.47-57, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00440025

M. Neuhaus and H. Bunke, Edit distance-based kernel functions for structural pattern classification, Pattern Recognition, vol.39, issue.10, pp.1852-1863, 2006.
DOI : 10.1016/j.patcog.2006.04.012

R. Raveaux, S. Adam, P. Héroux, and E. Trupin, Learning graph prototypes for shape recognition, Computer Vision and Image Understanding, vol.115, issue.7, pp.905-918, 2011.
DOI : 10.1016/j.cviu.2010.12.015
URL : https://hal.archives-ouvertes.fr/hal-00593453

H. Zanghi, C. Ambroise, and V. Miele, Fast online graph clustering via Erd??s???R??nyi mixture, Pattern Recognition, vol.41, issue.12, pp.3592-3599, 2008.
DOI : 10.1016/j.patcog.2008.06.019
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.2195

H. Qiu and E. Hancock, Graph matching and clustering using spectral partitions, Pattern Recognition, vol.39, issue.1, pp.22-34, 2006.
DOI : 10.1016/j.patcog.2005.06.014
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.6296

F. E. Lozano, Protein classification by matching and clustering surface graphs, Pattern Recognition, vol.39, issue.4, pp.539-551, 2006.
DOI : 10.1016/j.patcog.2005.10.008
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.1560

L. P. Cordella, P. Foggia, C. Sansone, and M. Vento, A (sub)graph isomorphism algorithm for matching large graphs, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.26, issue.10, pp.1367-1372, 2004.
DOI : 10.1109/TPAMI.2004.75

S. Zampelli, Y. Deville, and C. Solnon, Solving subgraph isomorphism problems with constraint programming, Constraints, vol.23, issue.1, pp.327-353, 2010.
DOI : 10.1007/s10601-009-9074-3
URL : https://hal.archives-ouvertes.fr/hal-01381438

C. Solnon, AllDifferent-based filtering for subgraph isomorphism, Artificial Intelligence, vol.174, issue.12-13, pp.12-13, 2010.
DOI : 10.1016/j.artint.2010.05.002
URL : https://hal.archives-ouvertes.fr/hal-01381476

P. , L. Bodic, H. Locteau, S. Adam, P. Héroux et al., Symbol detection using region adjacency graphs and integer linear programming, Proceedings of the International Conference on Document Analysis and Recognition, pp.1320-1324, 2009.
DOI : 10.1109/icdar.2009.202
URL : https://hal.archives-ouvertes.fr/inria-00432616

D. Conte, P. Foggia, C. Sansone, and M. Vento, THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION, International Journal of Pattern Recognition and Artificial Intelligence, vol.18, issue.03, pp.265-298, 2004.
DOI : 10.1142/S0218001404003228
URL : https://hal.archives-ouvertes.fr/hal-01408706

J. Larrosa and G. Valiente, Constraint satisfaction algorithms for graph pattern matching, Mathematical Structures in Computer Science, vol.12, issue.04, pp.403-422, 2002.
DOI : 10.1017/S0960129501003577

J. R. Ullmann, An Algorithm for Subgraph Isomorphism, Journal of the ACM, vol.23, issue.1, pp.31-42, 1976.
DOI : 10.1145/321921.321925

L. P. Cordella, P. Foggia, C. Sansone, and M. Vento, Performance evaluation of the VF graph matching algorithm, Proceedings 10th International Conference on Image Analysis and Processing, pp.1172-1177, 1999.
DOI : 10.1109/ICIAP.1999.797762

D. E. Ghahraman, A. K. Wong, and T. Au, Graph Optimal Monomorphism Algorithms, IEEE Transactions on Systems, Man, and Cybernetics, vol.10, issue.4, pp.181-188, 1980.
DOI : 10.1109/TSMC.1980.4308468

A. K. Wong, M. You, and S. C. Chan, An algorithm for graph optimal monomorphism, IEEE Transactions on Systems, Man, and Cybernetics, vol.20, issue.3, pp.628-638, 1990.
DOI : 10.1109/21.57275

R. C. Wilson and E. R. Hancock, Structural matching by discrete relaxation, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.19, issue.6, pp.634-648, 1997.
DOI : 10.1109/34.601251
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.2376

H. A. Almohamad and S. O. Duffuaa, A linear programming approach for the weighted graph matching problem, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.15, issue.5, pp.522-525, 1993.
DOI : 10.1109/34.211474

D. Justice and A. , A binary linear programming formulation of the graph edit distance, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.28, issue.8, pp.1200-1214, 2006.
DOI : 10.1109/TPAMI.2006.152

G. L. Nemhauser and L. A. Wolsey, Integer and combinatorial optimization, 1988.
DOI : 10.1002/9781118627372
URL : http://dx.doi.org/10.1016/s0898-1221(99)91259-2

D. L. Applegate, R. E. Bixby, V. Chvatal, and W. J. Cook, The Traveling Salesman Problem: A Computational Study, Princeton Series in Applied Mathematics), 2007.

E. Danna, M. Fenelon, Z. Gu, and R. Wunderling, Generating Multiple Solutions for Mixed Integer Programming Problems, IPCO '07: Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization, pp.280-294, 2007.
DOI : 10.1007/978-3-540-72792-7_22

P. Erdös and A. Rényi, On random graphs, Publicationes Mathematicae, vol.6, pp.290-297, 1959.

S. Tabbone, L. Wendling, and K. Tombre, Matching of graphical symbols in line-drawing images using angular signature information, International Journal on Document Analysis and Recognition, vol.6, issue.2, pp.115-125, 2003.
DOI : 10.1007/s10032-003-0105-0
URL : https://hal.archives-ouvertes.fr/inria-00099540

S. Adam, J. Ogier, C. Cariou, R. Mullot, J. Labiche et al., Symbol and character recognition: application to engineering drawings, International Journal on Document Analysis and Recognition, vol.3, issue.2, pp.89-101, 2000.
DOI : 10.1007/s100320000033
URL : https://hal.archives-ouvertes.fr/hal-00439443

P. Dosch and J. Lladós, Vectorial Signatures for Symbol Discrimination, Lecture Notes in Computer Science, vol.3088, pp.154-165, 2004.
DOI : 10.1007/978-3-540-25977-0_14
URL : https://hal.archives-ouvertes.fr/inria-00100002

W. Zhang and L. Wenyin, A New Vectorial Signature for Quick Symbol Indexing, Filtering and Recognition, Ninth International Conference on Document Analysis and Recognition (ICDAR 2007), pp.536-540, 2007.
DOI : 10.1109/ICDAR.2007.4378767

J. Lladós, E. Martí, and J. J. Villanueva, Symbol recognition by error-tolerant subgraph matching between region adjacency graphs, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.23, issue.10, pp.1137-1143, 2001.
DOI : 10.1109/34.954603

E. Barbu, P. Héroux, S. Adam, and E. Trupin, Using Bags of Symbols for Automatic Indexing of Graphical Document Image Databases, Lecture Notes in Computer Science, pp.195-205, 2005.
DOI : 10.1007/11767978_18
URL : https://hal.archives-ouvertes.fr/hal-00601527

H. Locteau, S. Adam, E. Trupin, J. Labiche, and P. Héroux, Symbol spotting using full visibility graph representation, Proceedings of the seventh International Workshop on graphics Recognition, pp.49-50, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00671265

R. L. Qureshi, J. Ramel, D. Barret, and H. Cardot, Spotting Symbols in Line Drawing Images Using Graph Representations, Lecture Notes in Computer Science, pp.91-103, 2008.
DOI : 10.1007/978-3-540-88188-9_10
URL : https://hal.archives-ouvertes.fr/hal-01026397

M. Teague, Image analysis via the general theory of moments*, Journal of the Optical Society of America, vol.70, issue.8, pp.920-930, 1980.
DOI : 10.1364/JOSA.70.000920

M. Delalandre, E. Valveny, T. Pridmore, and D. Karatzas, Generation of synthetic documents for performance evaluation of symbol recognition & spotting systems, International Journal on Document Analysis and Recognition (IJDAR), vol.12, issue.2, pp.187-207, 2010.
DOI : 10.1007/s10032-010-0120-x
URL : https://hal.archives-ouvertes.fr/hal-01022594

B. T. Messmer and H. Bunke, A new algorithm for error-tolerant subgraph isomorphism detection, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.20, issue.5, pp.493-504, 1998.
DOI : 10.1109/34.682179

S. Tabbone, L. Wendling, and D. Zuwala, A Hybrid Approach to Detect Graphical Symbols in Documents, Document Analysis System VI, pp.342-353, 2004.
DOI : 10.1007/978-3-540-28640-0_33
URL : https://hal.archives-ouvertes.fr/inria-00000239

S. Sorlin, C. Solnon, and J. Jolion, Applied Graph Theory in Computer Vision and Pattern Recognition, of Studies in Computational Intelligence, pp.151-182, 2007.