P. R. Amestoy, I. S. Duff, D. Ruiz, and B. Uçar, A Parallel Matrix Scaling Algorithm, High Performance Computing for Computational Science -VECPAR 2008: 8th International Conference, ser. LNCS, pp.301-313, 2008.
DOI : 10.1007/978-3-540-92859-1_27
URL : https://hal.archives-ouvertes.fr/hal-00803489

J. Aronson, M. Dyer, A. Frieze, and S. Suen, Randomized greedy matching. II, Random Structures & Algorithms, vol.2, issue.1, pp.55-73, 1995.
DOI : 10.1002/rsa.3240060107

J. Aronson, A. Frieze, and B. G. , Maximum matchings in sparse random graphs: Karp???Sipser revisited, Random Structures and Algorithms, vol.12, issue.2, pp.111-177, 1998.
DOI : 10.1002/(SICI)1098-2418(199803)12:2<111::AID-RSA1>3.3.CO;2-4

A. Azad, M. Halappanavar, S. Rajamanickam, E. G. Boman, A. Khan et al., Multithreaded algorithms for maximum matching in bipartite graphs, IEEE 26th International Parallel Distributed Processing Symposium (IPDPS), pp.2012-860

D. A. Bader, H. Meyerhenke, P. Sanders, D. Wagner, ¨. V. et al., Graph Partitioning and Graph Clustering -10th DIMACS Implementation Challenge Workshop, Georgia Institute of Technology Multithreaded clustering for multi-level hypergraph partitioning On shared-memory parallelization of a sparse matrix scaling algorithm, Proceedings, ser. Contemporary Mathematics 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) 2012 41st International Conference on Parallel Processing, pp.848-859, 2012.

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

M. Deveci, K. Kaya, ¨. U. , and B. Uçar, A push-relabelbased maximum cardinality matching algorithm on GPUs, 42nd International Conference on Parallel Processing, pp.21-29, 2013.

M. Deveci, K. Kaya, and B. V. Uçar, GPU Accelerated Maximum Cardinality Matching Algorithms for Bipartite Graphs, Euro- Par 2013 Parallel Processing, ser. LNCS, pp.850-861, 2013.
DOI : 10.1007/978-3-642-40047-6_84
URL : https://hal.archives-ouvertes.fr/hal-00923449

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, pp.1-1331, 2011.
DOI : 10.1145/2049673.2049677
URL : https://hal.archives-ouvertes.fr/hal-00786548

A. L. Dulmage and N. S. Mendelsohn, Coverings of bipartite graphs, Journal canadien de math??matiques, vol.10, issue.0, pp.517-534, 1958.
DOI : 10.4153/CJM-1958-052-0

M. E. Dyer and A. M. Frieze, Randomized greedy matching, Random Structures & Algorithms, vol.52, issue.1, pp.29-45, 1991.
DOI : 10.1002/rsa.3240020104

P. Erdös and A. Rényi, On random matrices, Publications of the Mathematical Institute of the Hungarian Academy of Sciences, pp.455-461, 1964.

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

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

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

M. Karo´nskikaro´nski and B. Pittel, Existence of a perfect matching in a random (1+e???1)???out bipartite graph, Journal of Combinatorial Theory, Series B, vol.88, issue.1, pp.1-16, 2003.
DOI : 10.1016/S0095-8956(03)00024-8

R. M. Karp and M. Sipser, Maximum matching in sparse random graphs, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981), pp.364-375, 1981.
DOI : 10.1109/SFCS.1981.21

R. M. Karp, U. V. Vazirani, and V. V. Vazirani, An optimal algorithm for on-line bipartite matching, Proceedings of the twenty-second annual ACM symposium on Theory of computing , STOC '90, pp.352-358, 1990.
DOI : 10.1145/100216.100262

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, 2013.
DOI : 10.1016/j.cor.2012.12.009
URL : https://hal.archives-ouvertes.fr/hal-00763920

P. A. Knight, The Sinkhorn???Knopp Algorithm: Convergence and Applications, SIAM Journal on Matrix Analysis and Applications, vol.30, issue.1, pp.261-275, 2008.
DOI : 10.1137/060659624

P. A. Knight, D. Ruiz, and B. Uçar, A Symmetry Preserving Algorithm for Matrix Scaling, SIAM Journal on Matrix Analysis and Applications, vol.35, issue.3, 2011.
DOI : 10.1137/110825753
URL : https://hal.archives-ouvertes.fr/inria-00569250

J. Langguth, F. Manne, and P. Sanders, Heuristic initialization for bipartite matching problems, Journal of Experimental Algorithmics, vol.15, pp.1-1, 2010.
DOI : 10.1145/1671970.1712656

A. Meir and J. W. Moon, The expected node-independence number of random trees, Indagationes Mathematicae (Proceedings), vol.76, issue.4, pp.335-341, 1973.
DOI : 10.1016/1385-7258(73)90029-2

M. Poloczek and M. Szegedy, Randomized Greedy Algorithms for the Maximum Matching Problem with New Analysis, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pp.708-717
DOI : 10.1109/FOCS.2012.20

A. Pothen and C. Fan, Computing the block triangular form of a sparse matrix, ACM Transactions on Mathematical Software, vol.16, issue.4, pp.303-324, 1990.
DOI : 10.1145/98267.98287

A. Pothen, Sparse null bases and marriage theorems, 1984.

D. Ruiz, A scaling algorithm to equilibrate both row and column norms in matrices, 2001.

R. Sinkhorn and P. Knopp, Concerning nonnegative matrices and doubly stochastic matrices, Pacific Journal of Mathematics, vol.21, issue.2, pp.343-348, 1967.
DOI : 10.2140/pjm.1967.21.343

D. W. Walkup, Matchings in random regular bipartite digraphs, Discrete Mathematics, vol.31, issue.1, pp.59-64, 1980.
DOI : 10.1016/0012-365X(80)90172-7