Translator Disclaimer
May, 1993 The Average Performance of the Greedy Matching Algorithm
Martin Dyer, Alan Frieze, Boris Pittel
Ann. Appl. Probab. 3(2): 526-552 (May, 1993). DOI: 10.1214/aoap/1177005436

Abstract

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.

Citation

Download Citation

Martin Dyer. Alan Frieze. Boris Pittel. "The Average Performance of the Greedy Matching Algorithm." Ann. Appl. Probab. 3 (2) 526 - 552, May, 1993. https://doi.org/10.1214/aoap/1177005436

Information

Published: May, 1993
First available in Project Euclid: 19 April 2007

zbMATH: 0779.60009
MathSciNet: MR1221164
Digital Object Identifier: 10.1214/aoap/1177005436

Subjects:
Primary: 60C05
Secondary: 05C70, 05C80, 60F05

Rights: Copyright © 1993 Institute of Mathematical Statistics

JOURNAL ARTICLE
27 PAGES


SHARE
Vol.3 • No. 2 • May, 1993
Back to Top