Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Dyer et al. (1993) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: