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

Prasad Chebolu, Alan M. Frieze, Páll Melsted. Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time. In Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz, editors, Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games. Volume 5125 of Lecture Notes in Computer Science, pages 161-172, Springer, 2008. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.