Finding a maximum matching in a sparse random graph in O(n) expected time

We present a linear expected time algorithm for finding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic factor.

• Type: Journal
• Year: 2010
• Where: JACM
• Authors: Prasad Chebolu, Alan M. Frieze, Páll Melsted
• Keywords: JACM 2010, Linear Expected Time, Maximum Cardinality Matchings, Sparse Random Graphs