Shapira, Andrew. 1997. “An Exact Performance Bound for an ${O (m+n)}$ Time Greedy Matching Procedure”. The Electronic Journal of Combinatorics 4 (1), R25. https://doi.org/10.37236/1310.