Finding maximum matchings in random regular graphs in linear expected time

Michael Anastos, Alan M. Frieze. Finding maximum matchings in random regular graphs in linear expected time. Random Struct. Algorithms, 58(3):390-429, 2021. [doi]

@article{AnastosF21-0,
  title = {Finding maximum matchings in random regular graphs in linear expected time},
  author = {Michael Anastos and Alan M. Frieze},
  year = {2021},
  doi = {10.1002/rsa.20980},
  url = {https://doi.org/10.1002/rsa.20980},
  researchr = {https://researchr.org/publication/AnastosF21-0},
  cites = {0},
  citedby = {0},
  journal = {Random Struct. Algorithms},
  volume = {58},
  number = {3},
  pages = {390-429},
}