1 citations · 1 across the 1 of their papers we have counts for
1 paper
Bert Besser, Bastian Werth
In the design of greedy algorithms for the maximum cardinality matching problem the utilization of degree information when selecting the next edge is a well established and success…