%0 Journal Article
%A Andrew Shapira
%T An exact performance bound for an \(O(m+n)\) time greedy matching procedure
%J The electronic journal of combinatorics
%D 1997
%V 4
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1310/
%R 10.37236/1310
%F 10_37236_1310