Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time.

Prasad Chebolu, Alan M. Frieze, Pll Melsted

Browse the full ICALP paper archive.