A. Azad, M. Halappanavar, S. Rajamanickam, E. G. Boman, A. Khan et al., Multithreaded algorithms for maximum matching in bipartite graphs, IEEE, pp.26-860, 2012.

A. Azad and A. Pothen, Multithreaded Algorithms for Matching in Graphs with Application to Data Analysis in Flow Cytometry, 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum, pp.2494-2497, 2012.
DOI : 10.1109/IPDPSW.2012.310

C. Berge, TWO THEOREMS IN GRAPH THEORY, Proceedings of the National Academy of Sciences, vol.43, issue.9, pp.842-844, 1957.
DOI : 10.1073/pnas.43.9.842

C. , ¨. U. Deveci, M. Kaya, K. Uçar, and B. , Multithreaded clustering for multi-level hypergraph partitioning, IEEE, pp.26-848, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00763565

T. A. Davis and Y. Hu, The university of Florida sparse matrix collection, ACM Transactions on Mathematical Software, vol.38, issue.1, pp.1-125, 2011.
DOI : 10.1145/2049662.2049663

I. S. Duff, A. M. Erisman, and J. K. Reid, Direct Methods for Sparse Matrices, 1986.

I. S. Duff, K. Kaya, and B. Uçar, Design, implementation, and analysis of maximum transversal algorithms, ACM Transactions on Mathematical Software, vol.38, issue.2, p.13, 2011.
DOI : 10.1145/2049673.2049677
URL : https://hal.archives-ouvertes.fr/hal-00786548

I. S. Duff and T. Wiberg, Remarks on implementation of O(n1/2??) assignment algorithms, ACM Transactions on Mathematical Software, vol.14, issue.3, pp.267-287, 1988.
DOI : 10.1145/44128.44131

F. Auer, B. Bisseling, and R. , A GPU algorithm for greedy graph matching. Facing the Multicore-Challenge II pp, pp.108-119, 2012.

A. Goldberg and R. Kennedy, Global Price Updates Help, SIAM Journal on Discrete Mathematics, vol.10, issue.4, pp.551-572, 1997.
DOI : 10.1137/S0895480194281185

A. V. Goldberg and R. E. Tarjan, A new approach to the maximum-flow problem, Journal of the ACM, vol.35, issue.4, pp.921-940, 1988.
DOI : 10.1145/48014.61051

M. Halappanavar, J. Feo, O. Villa, A. Tumeo, and A. Pothen, Approximate weighted matching on emerging manycore and multithreaded architectures, International Journal of High Performance Computing Applications, vol.26, issue.4, pp.413-430, 2012.
DOI : 10.1177/1094342012452893

D. S. Hochbaum, The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem, pp.6-325, 1998.
DOI : 10.1007/3-540-69346-7_25

J. E. Hopcroft and R. M. Karp, An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs, SIAM Journal on Computing, vol.2, issue.4, pp.225-231, 1973.
DOI : 10.1137/0202019

P. E. John, H. Sachs, and M. Zheng, Kekule patterns and Clar patterns in bipartite plane graphs, Journal of Chemical Information and Modeling, vol.35, issue.6, pp.1019-1021, 1995.
DOI : 10.1021/ci00028a010

K. Kaya, J. Langguth, F. Manne, and B. Uçar, Push-relabel based algorithms for the maximum transversal problem, Computers & Operations Research, vol.40, issue.5, pp.1266-1275, 2012.
DOI : 10.1016/j.cor.2012.12.009
URL : https://hal.archives-ouvertes.fr/hal-00763920

W. Y. Kim and A. C. Kak, 3-D object recognition using bipartite matching embedded in discrete relaxation, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.13, issue.3, pp.224-251, 1991.
DOI : 10.1109/34.75511

C. Vasconcelos and B. Rosenhahn, Bipartite Graph Matching Computation on GPU, pp.42-55, 2009.
DOI : 10.1016/0893-6080(94)90081-7