• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Finding maximum matchings in random regular graphs in linear expected time.

Michael AnastosAlan M. Frieze
Published in: Random Struct. Algorithms (2021)
Keyphrases