Z. Abu-aisheh, R. Raveaux, and J. Ramel, A Graph Database Repository and Performance Evaluation Metrics for Graph Edit Distance, pp.138-147, 2015.
DOI : 10.1007/978-3-319-18224-7_14
URL : https://hal.archives-ouvertes.fr/hal-01168809

Z. Abu-aisheh, R. Raveaux, J. Ramel, and P. Martineau, An Exact Graph Edit Distance Algorithm for Solving Pattern Recognition Problems, Proceedings of the International Conference on Pattern Recognition Applications and Methods, pp.271-278, 2015.
DOI : 10.5220/0005209202710278
URL : https://hal.archives-ouvertes.fr/hal-01168816

R. Allen, C. L. Yasuda, and D. , A parallel algorithm for graph matching and its MasPar implementation, IEEE Transactions on Parallel and Distributed Systems, vol.8, issue.5, pp.490-501, 1997.
DOI : 10.1109/71.598276

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. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Athena Scientific, 1997.

S. Bougleux, L. Brun, V. Carletti, P. Foggia, B. Gauzerec et al., Graph edit distance as a quadratic assignment problem, Pattern Recognition Letters, vol.87, 2016.
DOI : 10.1016/j.patrec.2016.10.001
URL : https://hal.archives-ouvertes.fr/hal-01613964

A. Boukedjar, M. Lalami, and D. El-baz, Parallel Branch and Bound on a CPU-GPU System, 2012 20th Euromicro International Conference on Parallel, Distributed and Network-based Processing, pp.392-398, 2012.
DOI : 10.1109/PDP.2012.23
URL : https://hal.archives-ouvertes.fr/hal-01152948

L. Brun, Relationships between graph edit distance and maximal common structural subgraph, 2012.

H. Bunke, On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letter, pp.689-694, 1997.
DOI : 10.1016/s0167-8655(97)00060-3

I. Chakroun and N. Melab, Operator-level GPU-Accelerated Branch and Bound Algorithms, Procedia Computer Science, vol.18, 2013.
DOI : 10.1016/j.procs.2013.05.191
URL : https://hal.archives-ouvertes.fr/hal-00807893

C. Chung, J. Flynn, and J. Sang, Parallelization of a Branch and Bound Algorithm on Multicore Systems, Journal of Software Engineering and Applications, vol.05, issue.08, pp.12-18, 2012.
DOI : 10.4236/jsea.2012.58071

T. H. Cormen, Introduction to Algorithms, 2009.

X. Cortés and F. Serratosa, Learning graph-matching edit-costs based on the optimality of the oracle's node correspondences, Pattern Recognition Letters, vol.56, pp.22-29, 2015.
DOI : 10.1016/j.patrec.2015.01.009

L. Deng and D. Yu, Deep learning: Methods and applications. Found. Trends Signal Process, pp.197-387, 2014.
DOI : 10.1561/2000000039
URL : http://research.microsoft.com/pubs/209355/DeepLearning-NowPublishing-Vol7-SIG-039.pdf

I. Dorta, C. Leon, and C. Rodriguez, A comparison between mpi and openmp branch-and-bound skeletons, Parallel and Distributed Processing Symposium, 2003. Proceedings. International, pp.66-73, 2003.
DOI : 10.1109/ipdps.2003.1213254

M. Drozdowski, Scheduling for Parallel Processing, 2009.
DOI : 10.1007/978-1-84882-310-5

S. Fankhauser, K. Riesen, H. Bunke, and P. J. Dickinson, SUBOPTIMAL GRAPH ISOMORPHISM USING BIPARTITE MATCHING, International Journal of Pattern Recognition and Artificial Intelligence, vol.30, issue.06, 2012.
DOI : 10.1109/34.6778

M. Ferrer, F. Serratosa, and K. Riesen, A First Step Towards Exact Graph Edit Distance Using Bipartite Graph Matching, pp.77-86, 2015.
DOI : 10.1007/978-3-319-18224-7_8

A. Fischer, C. Y. Suen, V. Frinken, K. Riesen, and H. Bunke, A fast matching algorithm for graph-based handwriting recognition. Graph-Based Representations in Pattern Recognition, pp.194-203, 2013.
DOI : 10.1007/978-3-642-38221-5_21

A. Fischer, C. Y. Suen, V. Frinken, K. Riesen, and H. Bunke, Approximation of graph edit distance based on Hausdorff matching, Pattern Recognition, vol.48, issue.2, pp.331-343, 2015.
DOI : 10.1016/j.patcog.2014.07.015

B. Gauzere, L. Brun, and D. Villemin, Two new graphs kernels in chemoinformatics, Pattern Recognition Letters, vol.33, issue.15, pp.2038-2047, 2012.
DOI : 10.1016/j.patrec.2012.03.020
URL : https://hal.archives-ouvertes.fr/hal-00773283

H. Bunke and G. A. , Inexact graph matching for structural pattern recognition, Pattern Recognition Letters, vol.1, issue.4, pp.245-253, 1983.
DOI : 10.1016/0167-8655(83)90033-8

D. Justice and H. 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

V. Kumar, P. S. Gopalakrishnan, and L. N. Kanal, Parallel Algorithms for Machine Intelligence and Vision, 1990.
DOI : 10.1007/978-1-4612-3390-9

M. Leordeanu, M. Hebert, and R. Sukthankar, An integer projected fixed point method for graph matching and map inference, Proceedings Neural Information Processing Systems, pp.1114-1122, 2009.

Z. Liu and H. Qiao, GNCCP—Graduated NonConvexityand Concavity Procedure, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.36, issue.6, pp.1258-1267, 2014.
DOI : 10.1109/TPAMI.2013.223

M. Neuhaus, K. R. Bunke, and H. , Fast Suboptimal Algorithms for the Computation of Graph Edit Distance, Proceedings of 11th International Workshop on Structural and Syntactic Pattern Recognition, pp.163-172, 2006.
DOI : 10.1007/11815921_17

M. O. Neary and P. R. Cappello, Advanced eager scheduling for javabased adaptive parallel computing. Concurrency -Practice and Experience 17, pp.797-819, 2005.
DOI : 10.1002/cpe.855

M. Neuhaus and H. Bunke, Bridging the gap between graph edit distance and kernel machines. Machine Perception and Artificial Intelligence, pp.17-61, 2007.
DOI : 10.1142/6523

V. N. Rao and V. Kumar, Parallel depth first search. Part I. Implementation, International Journal of Parallel Programming, vol.29, issue.1, pp.479-499, 1987.
DOI : 10.1007/BF01389000

K. Riesen and B. H. , IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning, Pattern Recognition Letters, vol.28, issue.1, pp.287-297, 2008.
DOI : 10.1093/nar/28.1.235

K. Riesen and B. H. , Approximate graph edit distance computation by means of bipartite graph matching. Image and Vision Computing, pp.950-959, 2009.

K. Riesen, Structural Pattern Recognition with Graph Edit Distance -Approximation Algorithms and Applications. Advances in Computer Vision and Pattern Recognition, 2015.
DOI : 10.1007/978-3-319-27252-8

K. Riesen and H. Bunke, Improving Approximate Graph Edit Distance by Means of a Greedy Swap Strategy, pp.314-321, 2014.
DOI : 10.1007/978-3-319-07998-1_36

K. Riesen, S. Fankhauser, and H. Bunke, Speeding up graph edit distance computation with a bipartite heuristic, 2007.

K. Riesen, A. Fischer, and H. Bunke, Improving Approximate Graph Edit Distance Using Genetic Algorithms, pp.14-63, 2014.
DOI : 10.1007/978-3-662-44415-3_7

A. Sanfeliu and K. Fu, A distance measure between attributed relational graphs for pattern recognition, IEEE Transactions on Systems, Man, and Cybernetics, vol.13, issue.3, pp.353-362, 1983.
DOI : 10.1109/TSMC.1983.6313167

F. Serratosa, Speeding up Fast Bipartite Graph Matching Through a New Cost Matrix, International Journal of Pattern Recognition and Artificial Intelligence, vol.29, issue.02, 2015.
DOI : 10.1016/S0167-8655(97)00117-7

W. Tsai, S. Member, and K. Fu, A Pattern Deformational Model and Bayes Error-Correcting Recognition System, IEEE Transactions on Systems, Man, and Cybernetics, vol.9, issue.12, pp.745-756, 1979.
DOI : 10.1109/TSMC.1979.4310126

C. Van-loan, Computational Frameworks for the Fast Fourier Trans- form, 1992.

W. Christmas, J. K. Petrou, and M. , Structural matching in computer vision using probabilistic relaxation, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.17, issue.8, pp.749-764, 1995.
DOI : 10.1109/34.400565
URL : ftp://ftp.ee.surrey.ac.uk/pub/vision/papers/christmas-phd95.ps.Z

C. Xu and F. C. Lau, Load Balancing in Parallel Computers: Theory and Practice, 1997.

Z. Zeng, A. K. Tung, J. Wang, J. Feng, and L. Zhou, Comparing stars, Proc. VLDB Endow, pp.25-36, 2009.
DOI : 10.14778/1687627.1687631