@dblp

Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time.

, , and . ICALP (1), volume 5125 of Lecture Notes in Computer Science, page 161-172. Springer, (2008)

Links and resources

Tags