Randomized Greedy Algorithms for the Maximum Matching Problem with New Analysis

Matthias Poloczek, Mario Szegedy. Randomized Greedy Algorithms for the Maximum Matching Problem with New Analysis. In 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012. pages 708-717, IEEE Computer Society, 2012. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.