Sciweavers

33
Voted
JACM
2010

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

13 years 9 months ago
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.
Prasad Chebolu, Alan M. Frieze, Páll Melste
Added 28 Jan 2011
Updated 28 Jan 2011
Type Journal
Year 2010
Where JACM
Authors Prasad Chebolu, Alan M. Frieze, Páll Melsted
Comments (0)