T. Akutsu, Protein structure alignment using a graph matching technique, Bioinformatics Center, pp.611-622, 1995.

I. Alaya, C. Solnon, and K. Ghédira, Ant algorithm for the multi-dimensional knapsack problem, International Conference on Bioinspired Optimization Methods and their Applications, pp.63-72, 2004.

I. Alaya, C. Solnon, and K. Ghédira, Optimisation par colonies de fourmis pour le problème du sac-àdos multidimensionnel, To appear in Techniques et Sciences Informatiques (TSI), 2006.
DOI : 10.3166/tsi.26.371-390

R. Ambauen, S. Fischer, and H. Bunke, Graph Edit Distance with Node Splitting and Merging, and Its Application to Diatom Identification, 4th IAPR-TC15 Wk on Graph-based Representations in Pattern Recognition, pp.95-106, 2003.
DOI : 10.1007/3-540-45028-9_9

R. Battiti and M. Protasi, Reactive local search for the maximum clique problem, pp.610-637, 2001.

M. Boeres, C. Ribeiro, and I. Bloch, A Randomized Heuristic for Scene Recognition by Graph Matching, Wkshp on Experimental and Efficient Algorithms, pp.100-113, 2004.
DOI : 10.1007/978-3-540-24838-5_8

H. Bunke, On a relation between graph edit distance and maximum common subgraph. PRL : Pattern Recognition Letters, pp.689-694, 1997.

E. Burke, B. Maccarthy, S. Petrovic, and R. Qu, Case-Based Reasoning in Course Timetabling: An Attribute Graph Approach, Proc. 4th Int. Conf. on Case-Based Reasoning (ICCBR-2001), LNAI 2080, pp.90-104, 2001.
DOI : 10.1007/3-540-44593-5_7

P. Champin and C. Solnon, Measuring the Similarity of Labeled Graphs, 5th Int. Conf. on Case-Based Reasoning, pp.80-95, 2003.
DOI : 10.1007/3-540-45006-8_9

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

A. Deruyver, Y. Hodé, E. Leammer, and J. Jolion, Adaptive Pyramid and Semantic Graph: Knowledge Driven Segmentation, Graph-Based Representations in Pattern Recognition : 5th IAPR International Workshop. Proceedings, p.213, 2005.
DOI : 10.1007/978-3-540-31988-7_20

M. Dorigo and G. Caro, Ant colony optimization: a new meta-heuristic, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), pp.11-32, 1999.
DOI : 10.1109/CEC.1999.782657
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.7911

M. Dorigo and T. Stützle, Ant colony optimization, 2004.

F. Glover, Tabu search -part I, Journal on Computing, pp.190-260, 1989.

S. Kirkpatrick, S. Gelatt, and M. Vecchi, Optimisation by simulated annealing, Science, pp.671-680, 1983.

S. Petrovic, G. Kendall, and Y. Yang, A tabu search approach for graph-structured case retrieval, Proc. of the STarting Artificial Intelligence Researchers Symposium, pp.55-64, 2002.

O. Sammoud, C. Solnon, and K. Ghédira, Ant Algorithm for the Graph Matching Problem, 5th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2005), pp.213-223, 2005.
DOI : 10.1007/978-3-540-31996-2_20

C. Solnon and S. Fenet, A study of ACO capabilities for solving the maximum clique problem, Journal of Heuristics, vol.6, issue.4, 2006.
DOI : 10.1007/s10732-006-4295-8
URL : https://hal.archives-ouvertes.fr/hal-01513687

S. Sorlin and C. Solnon, Reactive tabu search for measuring graph similarity. 5th IAPR Workshop on Graph-based Representations in Pattern Recognition, LNCS, vol.3434, pp.172-182, 2005.
DOI : 10.1007/978-3-540-31988-7_16
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.78.4434

T. Stützle and H. H. Hoos, ??? Ant System, Future Generation Computer Systems, vol.16, issue.8, pp.889-914, 2000.
DOI : 10.1016/S0167-739X(00)00043-1