Annals of Applied Probability

The Average Performance of the Greedy Matching Algorithm

Martin Dyer, Alan Frieze, and Boris Pittel

Full-text: Open access

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.

Article information

Source
Ann. Appl. Probab., Volume 3, Number 2 (1993), 526-552.

Dates
First available in Project Euclid: 19 April 2007

Permanent link to this document
https://projecteuclid.org/euclid.aoap/1177005436

Digital Object Identifier
doi:10.1214/aoap/1177005436

Mathematical Reviews number (MathSciNet)
MR1221164

Zentralblatt MATH identifier
0779.60009

JSTOR
links.jstor.org

Subjects
Primary: 60C05: Combinatorial probability
Secondary: 60F05: Central limit and other weak theorems 05C70: Factorization, matching, partitioning, covering and packing 05C80: Random graphs [See also 60B20]

Keywords
Greedy algorithm matching sparse random graphs central limit theorem

Citation

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


Export citation