M. Anastos and A. Frieze, Finding perfect matchings in random cubic graphs in linear time, 2018.

J. Aronson, A. M. Frieze, and B. G. Pittel, Maximum matchings in sparse random graphs: Karp-sipser revisited. Random Struct, Algorithms, vol.12, issue.2, pp.111-177, 1998.

M. Bartha and M. Kresz, A depth-first algorithm to reduce graphs in linear time, 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp.273-281, 2009.

P. Chebolu, A. M. Frieze, and P. Melsted, Finding a maximum matching in a sparse random graph in O(n) expected time, J. ACM, vol.57, issue.4, 2010.

T. A. Davis and Y. Hu, The University of Florida sparse matrix collection, ACM Transactions on Mathematical Software, vol.38, issue.1, p.1, 2011.

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.
URL : https://hal.archives-ouvertes.fr/hal-00786548

A. V. Goldberg and R. E. Tarjan, A new approach to the maximum-flow problem, J. ACM, vol.35, issue.4, pp.921-940, 1988.

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.

R. M. Karp and M. Sipser, Maximum matching in sparse random graphs, 22nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp.364-375, 1981.

K. Kaya, J. Langguth, F. Manne, and B. Uçar, Pushrelabel based algorithms for the maximum transversal problem
URL : https://hal.archives-ouvertes.fr/hal-00763920

, Computers & Operations Research, vol.40, issue.5, pp.1266-1275, 2013.

V. Korenwein, A. Nichterlein, P. Zschoche, and R. Niedermeier, Data reduction for maximum matching on real-world graphs: theory and experiments, 2018.

J. Langguth, F. Manne, and P. Sanders, Heuristic initialization for bipartite matching problems, J. Exp. Algorithmics, 2010.

J. Magun, Greeding matching algorithms, an experimental study, J. Exp. Algorithmics, vol.3, 1998.

G. B. Mertzios, A. Nichterlein, and R. Niedermeier, The power of linear-time data reduction for maximum matching, 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), vol.83, pp.1-46, 2017.

R. H. Möhring and M. Müller-hannemann, Cardinality matching: Heuristic search for augmenting paths, 1995.

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.

D. Walkup, Matchings in random regular bipartite digraphs. Discrete Mathematics, vol.31, pp.59-64, 1980.