The Average Performance of the Greedy Matching Algorithm
Martin Dyer, ALAN M. FRIEZE, Boris G. Pittel · The Annals of Applied Probability · 1993
We consider the expected performance of two greedy matching algorithms on sparse random graphs and also on random trees. In all cases we establish expressions for the mean and variance of the number of edges chosen and establish asymptotic normality.