External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Tags

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

Authors

Prasad Chebolu

This author has not been identified. Look up 'Prasad Chebolu' in Google

Alan M. Frieze

This author has not been identified. Look up 'Alan M. Frieze' in Google

Páll Melsted

This author has not been identified. Look up 'Páll Melsted' in Google
runs on