The Average Performance of the Greedy Matching Algorithm

Abstract
This paper we discuss the expected performance of the simplest of matchingalgorithms i.e. the GREEDY (or myopic) algorithm. Given a graph G the