Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs

We consider the performance of a simple greedy matching algorithm MINGREEDY when applied to random cubic graphs. We show that if λn is the expected number of vertices not matched by MINGREEDY, then there are positive constants c1 and c2 such that c1n1/5 ≤ λn ≤ c2n1/5 log n.

• Type: Conference
• Year: 1993
• Where: SODA
• Authors: Alan M. Frieze, A. J. Radcliffe, Stephen Suen
• Keywords: Algorithms, Cubic Graphs, Expected Number, Simple Greedy Matching, SODA 1993